About the Execution of ITS-Tools for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15781.950 | 1745411.00 | 1703734.00 | 68239.30 | TTFFFFFFFFFFFFTF | 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.r126-tajo-158961390900785.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 QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900785
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.8K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 153K 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 QuasiCertifProtocol-PT-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15
=== Now, execution of the tool begins
BK_START 1589857722964
[2020-05-19 03:08: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-19 03:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:08:44] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-19 03:08:44] [INFO ] Transformed 270 places.
[2020-05-19 03:08:44] [INFO ] Transformed 116 transitions.
[2020-05-19 03:08:44] [INFO ] Parsed PT model containing 270 places and 116 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9826 resets, run finished after 496 ms. (steps per millisecond=201 ) properties seen :[1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 03:08:45] [INFO ] Computed 155 place invariants in 14 ms
[2020-05-19 03:08:45] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-05-19 03:08:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 60 ms returned sat
[2020-05-19 03:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:45] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-19 03:08:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-19 03:08:45] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2020-05-19 03:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:45] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-05-19 03:08:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 03:08:46] [INFO ] Added : 48 causal constraints over 10 iterations in 154 ms. Result :sat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2020-05-19 03:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-19 03:08:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-05-19 03:08:46] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 68 ms returned sat
[2020-05-19 03:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:46] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2020-05-19 03:08:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:08:46] [INFO ] Added : 48 causal constraints over 10 iterations in 117 ms. Result :sat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-19 03:08:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:47] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-05-19 03:08:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 60 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:47] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-05-19 03:08:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:08:47] [INFO ] Added : 46 causal constraints over 10 iterations in 127 ms. Result :sat
[2020-05-19 03:08:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-19 03:08:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2020-05-19 03:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:48] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-05-19 03:08:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 03:08:48] [INFO ] Added : 61 causal constraints over 13 iterations in 224 ms. Result :sat
[2020-05-19 03:08:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-05-19 03:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:48] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-19 03:08:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-19 03:08:48] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 65 ms returned sat
[2020-05-19 03:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:48] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-19 03:08:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 03:08:49] [INFO ] Added : 53 causal constraints over 11 iterations in 153 ms. Result :sat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-05-19 03:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-05-19 03:08:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-19 03:08:49] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:49] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-05-19 03:08:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 03:08:49] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-19 03:08:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-19 03:08:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 03:08:50] [INFO ] Added : 48 causal constraints over 10 iterations in 138 ms. Result :sat
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-19 03:08:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 03:08:50] [INFO ] Added : 46 causal constraints over 10 iterations in 116 ms. Result :sat
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 52 ms returned sat
[2020-05-19 03:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-05-19 03:08:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 03:08:51] [INFO ] Added : 48 causal constraints over 10 iterations in 105 ms. Result :sat
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2020-05-19 03:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-19 03:08:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 03:08:51] [INFO ] Added : 47 causal constraints over 10 iterations in 119 ms. Result :sat
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:51] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-05-19 03:08:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:52] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-05-19 03:08:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 03:08:52] [INFO ] Added : 50 causal constraints over 10 iterations in 147 ms. Result :sat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using state equation in 145 ms returned unsat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2020-05-19 03:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:53] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-05-19 03:08:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 39 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-05-19 03:08:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-05-19 03:08:53] [INFO ] Added : 28 causal constraints over 6 iterations in 103 ms. Result :sat
[2020-05-19 03:08:53] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:53] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-05-19 03:08:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 36 ms returned sat
[2020-05-19 03:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:53] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-05-19 03:08:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 03:08:54] [INFO ] Added : 50 causal constraints over 10 iterations in 100 ms. Result :sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-05-19 03:08:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 03:08:54] [INFO ] Added : 51 causal constraints over 11 iterations in 154 ms. Result :sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 34 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-05-19 03:08:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 03:08:54] [INFO ] Added : 21 causal constraints over 5 iterations in 49 ms. Result :sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 39 ms returned sat
[2020-05-19 03:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:55] [INFO ] [Real]Absence check using state equation in 130 ms returned unsat
[2020-05-19 03:08:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-19 03:08:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:08:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 34 ms returned sat
[2020-05-19 03:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:08:55] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-05-19 03:08:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 03:08:55] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
[2020-05-19 03:08:55] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-19 03:08:55] [INFO ] Flatten gal took : 66 ms
FORMULA QuasiCertifProtocol-PT-06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:08:55] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 03:08:55] [INFO ] Applying decomposition
[2020-05-19 03:08:55] [INFO ] Flatten gal took : 24 ms
[2020-05-19 03:08:55] [INFO ] Input system was already deterministic with 116 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/graph13720334727828140333.txt, -o, /tmp/graph13720334727828140333.bin, -w, /tmp/graph13720334727828140333.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/graph13720334727828140333.bin, -l, -1, -v, -w, /tmp/graph13720334727828140333.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 03:08:55] [INFO ] Decomposing Gal with order
[2020-05-19 03:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:08:56] [INFO ] Computed 155 place invariants in 29 ms
inv : n9_2_6 + CstopOK_6 - SstopOK_2 = 0
inv : n7_6_0 - n7_6_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : n8_5_3 - n8_0_3 - n8_5_5 + n8_0_5 = 0
inv : malicious_reservoir + CstopAbort + SstopAbort = 3
inv : n7_2_2 - n7_2_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : n7_4_4 - n7_4_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_2_4 - n8_1_4 + n8_1_5 - n8_2_5 = 0
inv : n7_6_3 - n7_6_6 + n8_0_3 - n8_0_6 = 0
inv : n9_5_0 + CstopOK_0 - SstopOK_5 = 0
inv : n9_1_5 + CstopOK_5 - SstopOK_1 = 0
inv : n9_3_5 + CstopOK_5 - SstopOK_3 = 0
inv : n7_0_6 - n7_0_4 - n8_1_4 + n8_0_6 - n8_0_5 + n8_1_5 = 0
inv : n8_6_0 - n8_4_0 + n8_4_5 - n8_6_5 = 0
inv : n8_6_6 - n8_6_5 - n8_0_6 + n8_0_5 = 0
inv : n8_0_1 - n8_1_1 - n8_0_5 + n8_1_5 = 0
inv : n3_2 - n3_0 + n4_2 - n4_0 = 0
inv : n7_0_5 - n7_0_4 - n8_1_4 + n8_1_5 = 0
inv : n9_6_4 + CstopOK_4 - SstopOK_6 = 0
inv : n9_2_1 + CstopOK_1 - SstopOK_2 = 0
inv : n7_0_2 - n7_0_4 - n8_1_4 + n8_5_2 - n8_5_5 + n8_1_5 = 0
inv : -n1_0 + n2_3 - n2_0 + n1_3 = 0
inv : n7_3_1 - n7_3_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n7_6_2 - n7_6_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : n8_4_6 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : n7_2_0 - n7_2_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : n8_2_3 - n8_0_3 + n8_0_5 - n8_2_5 = 0
inv : n9_5_1 + CstopOK_1 - SstopOK_5 = 0
inv : n7_5_1 - n7_5_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : -n1_0 + n2_5 - n2_0 + n1_5 = 0
inv : n9_3_6 + CstopOK_6 - SstopOK_3 = 0
inv : n8_3_1 - n8_1_1 + n8_1_5 - n8_3_5 = 0
inv : -n5_4 + n5_6 + n6_6 - n6_4 = 0
inv : n8_4_1 - n8_1_1 - n8_4_5 + n8_1_5 = 0
inv : n9_4_2 + CstopOK_2 - SstopOK_4 = 0
inv : n7_4_2 - n7_4_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : s6_0 + s6_1 + s6_2 + s6_3 + s6_5 + s6_4 + SstopAbort + s6_6 + s5_1 + s5_0 + s5_3 + s5_2 + s5_5 + s5_4 + s4_0 + s5_6 + s4_2 + s4_1 + s4_4 + s4_3 + s3_0 + s3_1 + s4_5 + s4_6 + s3_4 + s3_5 + s3_2 + s3_3 + s2_1 + s2_2 + s3_6 + s2_0 + s2_5 + s2_6 + s2_3 + s2_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_6 + Sstart_5 + Sstart_4 + SstopOK_2 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_4 + SstopOK_5 = 7
inv : n7_4_3 - n7_4_6 + n8_0_3 - n8_0_6 = 0
inv : -n5_4 + n5_0 + n6_0 - n6_4 = 0
inv : n9_2_4 + CstopOK_4 - SstopOK_2 = 0
inv : n7_6_5 - n7_6_6 - n8_0_6 + n8_0_5 = 0
inv : n9_5_2 + CstopOK_2 - SstopOK_5 = 0
inv : n9_3_4 + CstopOK_4 - SstopOK_3 = 0
inv : n8_3_2 - n8_5_2 + n8_5_5 - n8_3_5 = 0
inv : n9_4_3 + CstopOK_3 - SstopOK_4 = 0
inv : n7_4_0 - n7_4_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : n3_1 - n3_0 + n4_1 - n4_0 = 0
inv : n8_4_3 - n8_0_3 - n8_4_5 + n8_0_5 = 0
inv : n7_4_5 - n7_4_6 - n8_0_6 + n8_0_5 = 0
inv : n9_1_2 + CstopOK_2 - SstopOK_1 = 0
inv : n8_3_6 - n8_0_6 + n8_0_5 - n8_3_5 = 0
inv : n8_2_6 - n8_0_6 + n8_0_5 - n8_2_5 = 0
inv : n7_3_0 - n7_3_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : Cstart_2 - Cstart_0 - n8_4_0 + n8_5_2 + n8_4_5 - n8_5_5 = 0
inv : n8_5_0 - n8_4_0 + n8_4_5 - n8_5_5 = 0
inv : n9_1_4 + CstopOK_4 - SstopOK_1 = 0
inv : n8_1_3 - n8_0_3 + n8_0_5 - n8_1_5 = 0
inv : n9_5_5 + CstopOK_5 - SstopOK_5 = 0
inv : -n3_0 + n4_6 + n3_6 - n4_0 = 0
inv : n7_1_3 - n7_1_6 + n8_0_3 - n8_0_6 = 0
inv : Cstart_4 - Cstart_0 - n8_4_0 + n8_1_4 + n8_4_5 - n8_1_5 = 0
inv : n9_3_2 + CstopOK_2 - SstopOK_3 = 0
inv : n9_1_1 + CstopOK_1 - SstopOK_1 = 0
inv : n8_1_0 - n8_4_0 + n8_4_5 - n8_1_5 = 0
inv : n8_3_3 - n8_0_3 + n8_0_5 - n8_3_5 = 0
inv : n9_5_3 + CstopOK_3 - SstopOK_5 = 0
inv : n7_6_1 - n7_6_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n7_4_1 - n7_4_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : -n5_4 + n5_2 + n6_2 - n6_4 = 0
inv : n9_2_2 + CstopOK_2 - SstopOK_2 = 0
inv : n9_1_0 + CstopOK_0 - SstopOK_1 = 0
inv : n8_6_4 - n8_1_4 - n8_6_5 + n8_1_5 = 0
inv : -n1_0 + n1_1 + n2_1 - n2_0 = 0
inv : n9_4_5 + CstopOK_5 - SstopOK_4 = 0
inv : n7_1_1 - n7_1_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_5_6 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : n9_6_5 + CstopOK_5 - SstopOK_6 = 0
inv : n8_0_0 - n8_4_0 + n8_4_5 - n8_0_5 = 0
inv : n8_4_2 - n8_5_2 - n8_4_5 + n8_5_5 = 0
inv : n7_2_4 - n7_2_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n9_2_0 + CstopOK_0 - SstopOK_2 = 0
inv : n8_3_4 - n8_1_4 + n8_1_5 - n8_3_5 = 0
inv : n9_0_2 + CstopOK_2 - SstopOK_0 = 0
inv : n9_5_4 + CstopOK_4 - SstopOK_5 = 0
inv : n7_3_4 - n7_3_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : -n1_0 + n2_6 - n2_0 + n1_6 = 0
inv : n7_3_2 - n7_3_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : n7_5_0 - n7_5_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : Cstart_6 - Cstart_0 - n8_4_0 + n8_4_5 + n8_0_6 - n8_0_5 = 0
inv : n8_5_4 - n8_1_4 - n8_5_5 + n8_1_5 = 0
inv : n9_0_5 + CstopOK_5 - SstopOK_0 = 0
inv : a5 + a2 + a4 + a3 + AstopAbort + a1 + Astart + AstopOK = 1
inv : n7_2_1 - n7_2_6 + n8_1_1 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_1_6 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n9_0_0 + CstopOK_0 - SstopOK_0 = 0
inv : n7_2_3 - n7_2_6 + n8_0_3 - n8_0_6 = 0
inv : n7_1_4 - n7_1_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_6_1 - n8_1_1 - n8_6_5 + n8_1_5 = 0
inv : c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + CstopAbort + CstopOK_0 + CstopOK_1 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + 7*Cstart_0 + 6*n8_4_0 - n8_1_1 - n8_1_4 - n8_5_2 - n8_0_3 - 6*n8_4_5 + n8_5_5 - n8_0_6 + 2*n8_0_5 + 2*n8_1_5 = 7
inv : n9_0_1 + CstopOK_1 - SstopOK_0 = 0
inv : n9_0_4 + CstopOK_4 - SstopOK_0 = 0
inv : n9_5_6 + CstopOK_6 - SstopOK_5 = 0
inv : n7_1_0 - n7_1_6 + n8_4_0 - n8_4_5 - n8_0_6 + n8_0_5 = 0
inv : n7_5_5 - n7_5_6 - n8_0_6 + n8_0_5 = 0
inv : -n1_0 + n2_2 - n2_0 + n1_2 = 0
inv : Cstart_5 - Cstart_0 - n8_4_0 + n8_4_5 = 0
inv : n7_5_2 - n7_5_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : n9_0_6 + CstopOK_6 - SstopOK_0 = 0
inv : n8_2_0 - n8_4_0 + n8_4_5 - n8_2_5 = 0
inv : n8_3_0 - n8_4_0 + n8_4_5 - n8_3_5 = 0
inv : n7_0_0 - n7_0_4 + n8_4_0 - n8_1_4 - n8_4_5 + n8_1_5 = 0
inv : n9_4_1 + CstopOK_1 - SstopOK_4 = 0
inv : n9_3_1 + CstopOK_1 - SstopOK_3 = 0
inv : n9_4_0 + CstopOK_0 - SstopOK_4 = 0
inv : -n5_4 + n5_5 + n6_5 - n6_4 = 0
inv : n8_6_2 - n8_5_2 + n8_5_5 - n8_6_5 = 0
inv : n8_6_3 - n8_0_3 - n8_6_5 + n8_0_5 = 0
inv : n9_6_2 + CstopOK_2 - SstopOK_6 = 0
inv : n7_1_5 - n7_1_6 - n8_0_6 + n8_0_5 = 0
inv : n7_1_2 - n7_1_6 + n8_5_2 - n8_5_5 - n8_0_6 + n8_0_5 = 0
inv : -n3_0 + n4_4 - n4_0 + n3_4 = 0
inv : -n1_0 + n2_4 - n2_0 + n1_4 = 0
inv : n9_6_3 + CstopOK_3 - SstopOK_6 = 0
inv : n9_1_6 + CstopOK_6 - SstopOK_1 = 0
inv : -n5_4 + n5_1 + n6_1 - n6_4 = 0
inv : -n5_4 + n5_3 + n6_3 - n6_4 = 0
inv : n7_3_5 - n7_3_6 - n8_0_6 + n8_0_5 = 0
inv : n7_5_4 - n7_5_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_1_2 - n8_5_2 + n8_5_5 - n8_1_5 = 0
inv : n7_6_4 - n7_6_6 + n8_1_4 - n8_0_6 + n8_0_5 - n8_1_5 = 0
inv : n8_2_2 - n8_5_2 + n8_5_5 - n8_2_5 = 0
inv : n8_0_4 - n8_1_4 - n8_0_5 + n8_1_5 = 0
inv : n7_5_3 - n7_5_6 + n8_0_3 - n8_0_6 = 0
inv : n9_6_0 + CstopOK_0 - SstopOK_6 = 0
inv : Cstart_1 - Cstart_0 - n8_4_0 + n8_1_1 + n8_4_5 - n8_1_5 = 0
inv : n9_3_3 + CstopOK_3 - SstopOK_3 = 0
inv : n3_3 - n3_0 + n4_3 - n4_0 = 0
inv : n7_2_5 - n7_2_6 - n8_0_6 + n8_0_5 = 0
inv : n7_0_3 - n7_0_4 - n8_1_4 + n8_0_3 - n8_0_5 + n8_1_5 = 0
inv : n9_2_5 + CstopOK_5 - SstopOK_2 = 0
inv : -n3_0 + n4_5 - n4_0 + n3_5 = 0
inv : n8_0_2 - n8_5_2 + n8_5_5 - n8_0_5 = 0
inv : n9_6_6 + CstopOK_6 - SstopOK_6 = 0
inv : n9_0_3 + CstopOK_3 - SstopOK_0 = 0
inv : n9_3_0 + CstopOK_0 - SstopOK_3 = 0
inv : n7_0_1 - n7_0_4 + n8_1_1 - n8_1_4 = 0
inv : n9_1_3 + CstopOK_3 - SstopOK_1 = 0
inv : n9_4_4 + CstopOK_4 - SstopOK_4 = 0
inv : n8_2_1 - n8_1_1 + n8_1_5 - n8_2_5 = 0
inv : n7_3_3 - n7_3_6 + n8_0_3 - n8_0_6 = 0
inv : n9_6_1 + CstopOK_1 - SstopOK_6 = 0
inv : Cstart_3 - Cstart_0 - n8_4_0 + n8_0_3 + n8_4_5 - n8_0_5 = 0
inv : n9_2_3 + CstopOK_3 - SstopOK_2 = 0
inv : n8_5_1 - n8_1_1 - n8_5_5 + n8_1_5 = 0
inv : n8_4_4 - n8_1_4 - n8_4_5 + n8_1_5 = 0
inv : n9_4_6 + CstopOK_6 - SstopOK_4 = 0
Total of 155 invariants.
[2020-05-19 03:08:56] [INFO ] Computed 155 place invariants in 32 ms
[2020-05-19 03:08:56] [INFO ] Removed a total of 93 redundant transitions.
[2020-05-19 03:08:56] [INFO ] Flatten gal took : 51 ms
[2020-05-19 03:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 14 ms.
[2020-05-19 03:08:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-19 03:08:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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 --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !(((F("(gi0.gu8.SstopAbort>gi0.gu8.AstopAbort)"))||(G(!(G("(((((((gu6.s3_0+gu6.s3_1)+gu6.s3_4)+gu6.s3_5)+gu6.s3_2)+gu6.s3_3)+gu6.s3_6)>=2)"))))))
Formula 0 simplified : !(F"(gi0.gu8.SstopAbort>gi0.gu8.AstopAbort)" | G!G"(((((((gu6.s3_0+gu6.s3_1)+gu6.s3_4)+gu6.s3_5)+gu6.s3_2)+gu6.s3_3)+gu6.s3_6)>=2)")
[2020-05-19 03:08:56] [INFO ] Proved 270 variables to be positive in 403 ms
[2020-05-19 03:08:56] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2020-05-19 03:08:56] [INFO ] Computation of disable matrix completed :0/116 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:08:56] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:08:56] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2020-05-19 03:08:56] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 03:08:57] [INFO ] Computing symmetric co enabling matrix : 116 transitions.
[2020-05-19 03:08:59] [INFO ] Computation of co-enabling matrix(24/116) took 2280 ms. Total solver calls (SAT/UNSAT): 1454(1418/36)
[2020-05-19 03:09:02] [INFO ] Computation of co-enabling matrix(53/116) took 5625 ms. Total solver calls (SAT/UNSAT): 3078(3042/36)
[2020-05-19 03:09:05] [INFO ] Computation of co-enabling matrix(63/116) took 8631 ms. Total solver calls (SAT/UNSAT): 3305(3269/36)
[2020-05-19 03:09:09] [INFO ] Computation of co-enabling matrix(84/116) took 11948 ms. Total solver calls (SAT/UNSAT): 3615(3565/50)
[2020-05-19 03:09:12] [INFO ] Computation of co-enabling matrix(89/116) took 15017 ms. Total solver calls (SAT/UNSAT): 3750(3700/50)
[2020-05-19 03:09:15] [INFO ] Computation of co-enabling matrix(98/116) took 18136 ms. Total solver calls (SAT/UNSAT): 3921(3871/50)
[2020-05-19 03:09:18] [INFO ] Computation of co-enabling matrix(113/116) took 21146 ms. Total solver calls (SAT/UNSAT): 4056(4006/50)
[2020-05-19 03:09:18] [INFO ] Computation of Finished co-enabling matrix. took 21199 ms. Total solver calls (SAT/UNSAT): 4057(4007/50)
[2020-05-19 03:09:18] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2020-05-19 03:09:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-19 03:09:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-19 03:09:20] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:630)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-19 03:09:20] [INFO ] Built C files in 24988ms 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 1676 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 71 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>((LTLAP0==true))) || ( [](!( []((LTLAP1==true))) )) , --buchi-type=spotba], 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, --ltl, ( <>((LTLAP0==true))) || ( [](!( []((LTLAP1==true))) )) , --buchi-type=spotba], 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, --ltl, ( <>((LTLAP0==true))) || ( [](!( []((LTLAP1==true))) )) , --buchi-type=spotba], 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)
Detected timeout of ITS tools.
[2020-05-19 03:29:01] [INFO ] Flatten gal took : 287 ms
[2020-05-19 03:29:01] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 67 ms
[2020-05-19 03:29:01] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 8 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, --gen-order, FOLLOW], 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 --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !(((F("(SstopAbort>AstopAbort)"))||(G(!(G("(((((((s3_0+s3_1)+s3_4)+s3_5)+s3_2)+s3_3)+s3_6)>=2)"))))))
Formula 0 simplified : !(F"(SstopAbort>AstopAbort)" | G!G"(((((((s3_0+s3_1)+s3_4)+s3_5)+s3_2)+s3_3)+s3_6)>=2)")
Reverse transition relation is NOT exact ! Due to transitions malC1_2, malC1_1, malC1_0, malC1_6, malC1_5, malC1_4, malC1_3, malS6_3, malS6_2, malS6_1, malS6_0, malS5_0, malS6_6, malS6_5, malS6_4, malS3_4, malS3_3, malS3_6, malS3_5, malS2_1, malS2_0, malS2_3, malS2_2, malS2_5, malS2_4, malS1_0, malS2_6, malS1_2, malS1_1, malS1_4, malS1_3, malS5_1, malS5_2, malS5_3, malS5_4, malS5_5, malS5_6, malS4_0, malS4_1, malS4_2, malS4_3, malS4_4, malS4_5, malS4_6, malS3_0, malS3_1, malS3_2, malA1, malA4, malA2, malA5, malA3, malS1_5, malS1_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/54/116
Computing Next relation with stutter on 4237 deadlock states
83 unique states visited
0 strongly connected components in search stack
95 transitions explored
63 items max in DFS search stack
22484 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,224.888,3966588,1,0,357,1.12522e+07,25,354,3602,1.04797e+07,949
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-06-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)<=((((((s3_0+s3_1)+s3_4)+s3_5)+s3_2)+s3_3)+s3_6))")))
Formula 1 simplified : !G"(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)<=((((((s3_0+s3_1)+s3_4)+s3_5)+s3_2)+s3_3)+s3_6))"
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4768 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,272.567,4013784,1,0,518,1.71265e+07,39,549,4883,1.28973e+07,1297
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((((F("(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)>=1)"))U("(((((((s5_1+s5_0)+s5_3)+s5_2)+s5_5)+s5_4)+s5_6)>=2)"))U(X(F((("(((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)>=1)")U("(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)>=1)"))&&("(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)<1)"))))))
Formula 2 simplified : !((F"(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)>=1)" U "(((((((s5_1+s5_0)+s5_3)+s5_2)+s5_5)+s5_4)+s5_6)>=2)") U XF("(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)<1)" & ("(((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)>=1)" U "(((((((SstopOK_2+SstopOK_3)+SstopOK_0)+SstopOK_1)+SstopOK_6)+SstopOK_4)+SstopOK_5)>=1)")))
Computing Next relation with stutter on 4237 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
2197 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,294.535,4023012,1,0,789,1.82572e+07,67,892,5047,1.41801e+07,1941
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((!(G("(((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)<=a1)"))))
Formula 3 simplified : G"(((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)<=a1)"
Computing Next relation with stutter on 4237 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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,294.714,4023012,1,0,830,1.82756e+07,76,930,5064,1.4201e+07,2062
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X((X(F("(((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)>=2)")))U(("(((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)>=2)")U("(CstopAbort>malicious_reservoir)"))))))
Formula 4 simplified : !XX(XF"(((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)>=2)" U ("(((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)>=2)" U "(CstopAbort>malicious_reservoir)"))
Computing Next relation with stutter on 4237 deadlock states
64 unique states visited
64 strongly connected components in search stack
64 transitions explored
64 items max in DFS search stack
2229 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,316.997,4045612,1,0,1642,2.11402e+07,89,1778,5106,1.80076e+07,3749
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(F(X("(Cstart_3<=AstopAbort)")))))
Formula 5 simplified : !GFX"(Cstart_3<=AstopAbort)"
Computing Next relation with stutter on 4237 deadlock states
65 unique states visited
65 strongly connected components in search stack
66 transitions explored
65 items max in DFS search stack
1143 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,328.431,4051756,1,0,1746,2.18666e+07,98,1957,5111,2.03085e+07,4141
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G((G("(a1>=1)"))U(!(X((X("(s3_6<=Astart)"))&&("(s3_6<=Astart)")))))))
Formula 6 simplified : !G(G"(a1>=1)" U !X("(s3_6<=Astart)" & X"(s3_6<=Astart)"))
Computing Next relation with stutter on 4237 deadlock states
67 unique states visited
67 strongly connected components in search stack
68 transitions explored
67 items max in DFS search stack
10 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,328.537,4052116,1,0,1770,2.18674e+07,105,1981,5117,2.0313e+07,4317
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G("(malicious_reservoir>a5)"))))
Formula 7 simplified : !FG"(malicious_reservoir>a5)"
Computing Next relation with stutter on 4237 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1116 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,339.694,4331016,1,0,2207,2.29223e+07,118,2394,5123,2.25836e+07,5322
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X((X(F(G("(c1_3<=AstopAbort)"))))||(X(!(F("(c1_3<=AstopAbort)")))))))
Formula 8 simplified : !X(XFG"(c1_3<=AstopAbort)" | X!F"(c1_3<=AstopAbort)")
Computing Next relation with stutter on 4237 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
11264 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,452.34,4372640,1,0,2234,2.2927e+07,22,2469,3564,2.26001e+07,945
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((!(X(X(G("((n6_4>=1)||(a4>=1))"))))))
Formula 9 simplified : XXG"((n6_4>=1)||(a4>=1))"
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3005 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,482.394,4386976,1,0,2234,2.47178e+07,32,2469,4486,2.26001e+07,959
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-06-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(X(F("(n1_2<=n6_2)")))))
Formula 10 simplified : !GXF"(n1_2<=n6_2)"
Computing Next relation with stutter on 4237 deadlock states
65 unique states visited
65 strongly connected components in search stack
66 transitions explored
65 items max in DFS search stack
1161 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,493.993,4391072,1,0,2234,2.53125e+07,46,2469,4653,2.26001e+07,1351
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1589859468375
--------------------
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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r126-tajo-158961390900785"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;