About the Execution of ITS-Tools for QuasiCertifProtocol-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15738.020 | 494620.00 | 559974.00 | 1333.30 | TTFFFFFFTFFFFTFT | 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-158961390800729.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-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800729
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15
=== Now, execution of the tool begins
BK_START 1589852240797
[2020-05-19 01:37:22] [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 01:37:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:37:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-19 01:37:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2020-05-19 01:37:23] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,
[2020-05-19 01:37:23] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 20 ms.
[2020-05-19 01:37:23] [INFO ] Computed order based on color domains.
[2020-05-19 01:37:23] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 10 ms.
[2020-05-19 01:37:23] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9840 resets, run finished after 712 ms. (steps per millisecond=140 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:37:24] [INFO ] Computed 155 place invariants in 14 ms
[2020-05-19 01:37:24] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-19 01:37:24] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 75 ms returned sat
[2020-05-19 01:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:24] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2020-05-19 01:37:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:37:24] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-05-19 01:37:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:24] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2020-05-19 01:37:24] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:25] [INFO ] Added : 48 causal constraints over 10 iterations in 151 ms. Result :sat
[2020-05-19 01:37:25] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:25] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 52 ms returned sat
[2020-05-19 01:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:25] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-19 01:37:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:25] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 359 ms returned sat
[2020-05-19 01:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:26] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2020-05-19 01:37:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:26] [INFO ] Added : 48 causal constraints over 10 iterations in 220 ms. Result :sat
[2020-05-19 01:37:26] [INFO ] [Real]Absence check using 11 positive place invariants in 52 ms returned unsat
[2020-05-19 01:37:26] [INFO ] [Real]Absence check using 11 positive place invariants in 57 ms returned unsat
[2020-05-19 01:37:26] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-19 01:37:26] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 107 ms returned sat
[2020-05-19 01:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:26] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-05-19 01:37:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:27] [INFO ] Added : 16 causal constraints over 4 iterations in 73 ms. Result :sat
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2020-05-19 01:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-19 01:37:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:27] [INFO ] Added : 42 causal constraints over 9 iterations in 123 ms. Result :sat
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-05-19 01:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:27] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-05-19 01:37:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-05-19 01:37:27] [INFO ] Added : 48 causal constraints over 10 iterations in 133 ms. Result :sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-05-19 01:37:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-05-19 01:37:28] [INFO ] Added : 61 causal constraints over 13 iterations in 157 ms. Result :sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:28] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-05-19 01:37:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 42 ms returned sat
[2020-05-19 01:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-05-19 01:37:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-05-19 01:37:29] [INFO ] Added : 52 causal constraints over 11 iterations in 152 ms. Result :sat
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-19 01:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-05-19 01:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:29] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-19 01:37:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:30] [INFO ] Added : 19 causal constraints over 4 iterations in 89 ms. Result :sat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:30] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2020-05-19 01:37:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 80 ms returned sat
[2020-05-19 01:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:30] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-05-19 01:37:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 22 ms.
[2020-05-19 01:37:31] [INFO ] Added : 50 causal constraints over 10 iterations in 168 ms. Result :sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 65 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-05-19 01:37:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-05-19 01:37:31] [INFO ] Added : 39 causal constraints over 8 iterations in 129 ms. Result :sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-05-19 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:31] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-05-19 01:37:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-05-19 01:37:32] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-05-19 01:37:32] [INFO ] Added : 20 causal constraints over 4 iterations in 87 ms. Result :sat
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 61 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:32] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-19 01:37:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 51 ms returned sat
[2020-05-19 01:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-05-19 01:37:33] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 21 ms.
[2020-05-19 01:37:33] [INFO ] Added : 50 causal constraints over 10 iterations in 293 ms. Result :sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 140 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:33] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-05-19 01:37:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2020-05-19 01:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2020-05-19 01:37:34] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 23 ms.
[2020-05-19 01:37:34] [INFO ] Added : 16 causal constraints over 4 iterations in 105 ms. Result :sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-05-19 01:37:34] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:34] [INFO ] Added : 50 causal constraints over 10 iterations in 139 ms. Result :sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2020-05-19 01:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:35] [INFO ] Added : 42 causal constraints over 9 iterations in 114 ms. Result :sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-05-19 01:37:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-05-19 01:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:35] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2020-05-19 01:37:35] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-05-19 01:37:36] [INFO ] Added : 47 causal constraints over 10 iterations in 136 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-05-19 01:37:36] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:37:36] [INFO ] Added : 41 causal constraints over 9 iterations in 114 ms. Result :sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-05-19 01:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-05-19 01:37:36] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-05-19 01:37:36] [INFO ] Added : 42 causal constraints over 9 iterations in 114 ms. Result :sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-05-19 01:37:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-19 01:37:37] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-05-19 01:37:37] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-05-19 01:37:37] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:37] [INFO ] Added : 42 causal constraints over 9 iterations in 100 ms. Result :sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 30 ms returned sat
[2020-05-19 01:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:38] [INFO ] Added : 52 causal constraints over 11 iterations in 133 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-05-19 01:37:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-05-19 01:37:38] [INFO ] Added : 39 causal constraints over 8 iterations in 82 ms. Result :sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-05-19 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:38] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-19 01:37:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:37:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2020-05-19 01:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:37:39] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-05-19 01:37:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 22 ms.
[2020-05-19 01:37:39] [INFO ] Added : 19 causal constraints over 4 iterations in 86 ms. Result :sat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2020-05-19 01:37:39] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-19 01:37:39] [INFO ] Flatten gal took : 59 ms
FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:37:39] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 01:37:39] [INFO ] Applying decomposition
[2020-05-19 01:37:39] [INFO ] Flatten gal took : 40 ms
[2020-05-19 01:37:39] [INFO ] Input system was already deterministic with 116 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 116 rows 270 cols
[2020-05-19 01:37:39] [INFO ] Computed 155 place invariants in 5 ms
inv : n7_31 - n7_34 - Cstart_3 + Cstart_6 = 0
inv : n7_22 - n7_27 - Cstart_1 + Cstart_6 = 0
inv : n7_40 - n7_41 - Cstart_5 + Cstart_6 = 0
inv : n8_1 - n8_6 + Cstart_1 - Cstart_6 = 0
inv : n8_10 - n8_13 + Cstart_3 - Cstart_6 = 0
inv : SstopAbort_0 + n9_5 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_5 = 7
inv : n8_35 - n8_41 + Cstart_0 - Cstart_6 = 0
inv : SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 = 7
inv : n8_26 - n8_27 + Cstart_5 - Cstart_6 = 0
inv : n7_47 - n7_48 - Cstart_5 + Cstart_6 = 0
inv : n7_29 - n7_34 - Cstart_1 + Cstart_6 = 0
inv : n7_15 - n7_20 - Cstart_1 + Cstart_6 = 0
inv : n8_19 - n8_20 + Cstart_5 - Cstart_6 = 0
inv : n8_28 - n8_34 + Cstart_0 - Cstart_6 = 0
inv : n8_37 - n8_41 + Cstart_2 - Cstart_6 = 0
inv : n8_46 - n8_48 + Cstart_4 - Cstart_6 = 0
inv : AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
inv : n8_33 - n8_34 + Cstart_5 - Cstart_6 = 0
inv : n6_1 - n6_6 + n5_1 - n5_6 = 0
inv : n7_33 - n7_34 - Cstart_5 + Cstart_6 = 0
inv : n9_13 - SstopOK_1 + CstopOK_6 = 0
inv : n7_17 - n7_20 - Cstart_3 + Cstart_6 = 0
inv : n8_42 - n8_48 + Cstart_0 - Cstart_6 = 0
inv : n9_11 - SstopOK_1 + CstopOK_4 = 0
inv : n8_44 - n8_48 + Cstart_2 - Cstart_6 = 0
inv : n9_29 - SstopOK_4 + CstopOK_1 = 0
inv : n8_30 - n8_34 + Cstart_2 - Cstart_6 = 0
inv : n7_24 - n7_27 - Cstart_3 + Cstart_6 = 0
inv : n9_31 - SstopOK_4 + CstopOK_3 = 0
inv : n7_45 - n7_48 - Cstart_3 + Cstart_6 = 0
inv : n7_38 - n7_41 - Cstart_3 + Cstart_6 = 0
inv : n4_1 - n4_6 + n3_1 - n3_6 = 0
inv : n9_24 - SstopOK_3 + CstopOK_3 = 0
inv : CstopAbort_0 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 = 7
inv : n9_32 - SstopOK_4 + CstopOK_4 = 0
inv : n7_18 - n7_20 - Cstart_4 + Cstart_6 = 0
inv : n7_43 - n7_48 - Cstart_1 + Cstart_6 = 0
inv : n9_17 - SstopOK_2 + CstopOK_3 = 0
inv : n8_40 - n8_41 + Cstart_5 - Cstart_6 = 0
inv : n7_0 - n7_6 - Cstart_0 + Cstart_6 = 0
inv : n4_3 - n4_6 + n3_3 - n3_6 = 0
inv : n2_2 - n2_6 + n1_2 - n1_6 = 0
inv : n8_22 - n8_27 + Cstart_1 - Cstart_6 = 0
inv : n9_9 - SstopOK_1 + CstopOK_2 = 0
inv : n9_25 - SstopOK_3 + CstopOK_4 = 0
inv : n9_8 - SstopOK_1 + CstopOK_1 = 0
inv : n9_16 - SstopOK_2 + CstopOK_2 = 0
inv : n9_33 - SstopOK_4 + CstopOK_5 = 0
inv : n8_32 - n8_34 + Cstart_4 - Cstart_6 = 0
inv : n9_34 - SstopOK_4 + CstopOK_6 = 0
inv : n7_8 - n7_13 - Cstart_1 + Cstart_6 = 0
inv : n4_4 - n4_6 + n3_4 - n3_6 = 0
inv : n9_7 - SstopOK_1 + CstopOK_0 = 0
inv : n7_36 - n7_41 - Cstart_1 + Cstart_6 = 0
inv : n8_47 - n8_48 + Cstart_5 - Cstart_6 = 0
inv : n9_20 - SstopOK_2 + CstopOK_6 = 0
inv : n9_23 - SstopOK_3 + CstopOK_2 = 0
inv : n8_5 - n8_6 + Cstart_5 - Cstart_6 = 0
inv : malicious_reservoir_0 + CstopAbort_0 + SstopAbort_0 = 3
inv : n7_35 - n7_41 - Cstart_0 + Cstart_6 = 0
inv : n9_21 - SstopOK_3 + CstopOK_0 = 0
inv : n9_18 - SstopOK_2 + CstopOK_4 = 0
inv : n8_39 - n8_41 + Cstart_4 - Cstart_6 = 0
inv : n9_19 - SstopOK_2 + CstopOK_5 = 0
inv : n9_22 - SstopOK_3 + CstopOK_1 = 0
inv : n7_1 - n7_6 - Cstart_1 + Cstart_6 = 0
inv : n6_2 - n6_6 + n5_2 - n5_6 = 0
inv : n8_12 - n8_13 + Cstart_5 - Cstart_6 = 0
inv : n7_42 - n7_48 - Cstart_0 + Cstart_6 = 0
inv : n7_46 - n7_48 - Cstart_4 + Cstart_6 = 0
inv : n4_0 - n4_6 + n3_0 - n3_6 = 0
inv : n7_25 - n7_27 - Cstart_4 + Cstart_6 = 0
inv : n8_15 - n8_20 + Cstart_1 - Cstart_6 = 0
inv : n8_8 - n8_13 + Cstart_1 - Cstart_6 = 0
inv : n9_14 - SstopOK_2 + CstopOK_0 = 0
inv : n8_29 - n8_34 + Cstart_1 - Cstart_6 = 0
inv : n9_15 - SstopOK_2 + CstopOK_1 = 0
inv : n7_32 - n7_34 - Cstart_4 + Cstart_6 = 0
inv : n9_26 - SstopOK_3 + CstopOK_5 = 0
inv : n8_36 - n8_41 + Cstart_1 - Cstart_6 = 0
inv : n9_27 - SstopOK_3 + CstopOK_6 = 0
inv : n6_5 - n6_6 + n5_5 - n5_6 = 0
inv : n7_11 - n7_13 - Cstart_4 + Cstart_6 = 0
inv : n7_4 - n7_6 - Cstart_4 + Cstart_6 = 0
inv : n8_43 - n8_48 + Cstart_1 - Cstart_6 = 0
inv : n8_18 - n8_20 + Cstart_4 - Cstart_6 = 0
inv : n8_0 - n8_6 + Cstart_0 - Cstart_6 = 0
inv : n7_39 - n7_41 - Cstart_4 + Cstart_6 = 0
inv : n7_30 - n7_34 - Cstart_2 + Cstart_6 = 0
inv : n7_5 - n7_6 - Cstart_5 + Cstart_6 = 0
inv : n7_23 - n7_27 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_4 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_4 = 7
inv : n7_14 - n7_20 - Cstart_0 + Cstart_6 = 0
inv : n7_21 - n7_27 - Cstart_0 + Cstart_6 = 0
inv : n9_42 - SstopOK_6 + CstopOK_0 = 0
inv : n7_12 - n7_13 - Cstart_5 + Cstart_6 = 0
inv : n7_3 - n7_6 - Cstart_3 + Cstart_6 = 0
inv : n7_28 - n7_34 - Cstart_0 + Cstart_6 = 0
inv : n7_7 - n7_13 - Cstart_0 + Cstart_6 = 0
inv : n8_7 - n8_13 + Cstart_0 - Cstart_6 = 0
inv : n2_5 - n2_6 + n1_5 - n1_6 = 0
inv : n8_25 - n8_27 + Cstart_4 - Cstart_6 = 0
inv : n9_28 - SstopOK_4 + CstopOK_0 = 0
inv : n8_11 - n8_13 + Cstart_4 - Cstart_6 = 0
inv : n8_4 - n8_6 + Cstart_4 - Cstart_6 = 0
inv : n8_23 - n8_27 + Cstart_2 - Cstart_6 = 0
inv : n9_12 - SstopOK_1 + CstopOK_5 = 0
inv : n9_10 - SstopOK_1 + CstopOK_3 = 0
inv : n9_30 - SstopOK_4 + CstopOK_2 = 0
inv : n8_2 - n8_6 + Cstart_2 - Cstart_6 = 0
inv : n2_3 - n2_6 + n1_3 - n1_6 = 0
inv : n8_9 - n8_13 + Cstart_2 - Cstart_6 = 0
inv : SstopAbort_0 + n9_6 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_6 = 7
inv : n8_16 - n8_20 + Cstart_2 - Cstart_6 = 0
inv : n9_47 - SstopOK_6 + CstopOK_5 = 0
inv : n6_3 - n6_6 + n5_3 - n5_6 = 0
inv : n9_40 - SstopOK_5 + CstopOK_5 = 0
inv : n7_44 - n7_48 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_0 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_0 = 7
inv : n8_21 - n8_27 + Cstart_0 - Cstart_6 = 0
inv : n7_10 - n7_13 - Cstart_3 + Cstart_6 = 0
inv : n7_19 - n7_20 - Cstart_5 + Cstart_6 = 0
inv : n6_4 - n6_6 + n5_4 - n5_6 = 0
inv : n4_2 - n4_6 + n3_2 - n3_6 = 0
inv : n8_31 - n8_34 + Cstart_3 - Cstart_6 = 0
inv : n7_9 - n7_13 - Cstart_2 + Cstart_6 = 0
inv : n9_41 - SstopOK_5 + CstopOK_6 = 0
inv : n7_26 - n7_27 - Cstart_5 + Cstart_6 = 0
inv : n9_37 - SstopOK_5 + CstopOK_2 = 0
inv : n8_14 - n8_20 + Cstart_0 - Cstart_6 = 0
inv : n2_1 - n2_6 + n1_1 - n1_6 = 0
inv : n7_2 - n7_6 - Cstart_2 + Cstart_6 = 0
inv : n9_38 - SstopOK_5 + CstopOK_3 = 0
inv : n9_39 - SstopOK_5 + CstopOK_4 = 0
inv : SstopAbort_0 + n9_1 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_1 = 7
inv : n2_0 - n2_6 + n1_0 - n1_6 = 0
inv : n9_35 - SstopOK_5 + CstopOK_0 = 0
inv : n7_37 - n7_41 - Cstart_2 + Cstart_6 = 0
inv : SstopAbort_0 + n9_3 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_3 = 7
inv : n8_3 - n8_6 + Cstart_3 - Cstart_6 = 0
inv : n9_43 - SstopOK_6 + CstopOK_1 = 0
inv : n6_0 - n6_6 + n5_0 - n5_6 = 0
inv : n2_4 - n2_6 + n1_4 - n1_6 = 0
inv : n8_45 - n8_48 + Cstart_3 - Cstart_6 = 0
inv : n4_5 - n4_6 + n3_5 - n3_6 = 0
inv : n8_38 - n8_41 + Cstart_3 - Cstart_6 = 0
inv : n7_16 - n7_20 - Cstart_2 + Cstart_6 = 0
inv : n9_44 - SstopOK_6 + CstopOK_2 = 0
inv : n8_24 - n8_27 + Cstart_3 - Cstart_6 = 0
inv : n9_36 - SstopOK_5 + CstopOK_1 = 0
inv : n9_45 - SstopOK_6 + CstopOK_3 = 0
inv : SstopAbort_0 + n9_2 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + CstopOK_2 = 7
inv : n8_17 - n8_20 + Cstart_3 - Cstart_6 = 0
inv : n9_46 - SstopOK_6 + CstopOK_4 = 0
inv : n9_48 - SstopOK_6 + CstopOK_6 = 0
Total of 155 invariants.
[2020-05-19 01:37:39] [INFO ] Computed 155 place invariants in 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph5388727781591619423.txt, -o, /tmp/graph5388727781591619423.bin, -w, /tmp/graph5388727781591619423.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/graph5388727781591619423.bin, -l, -1, -v, -w, /tmp/graph5388727781591619423.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:37:39] [INFO ] Decomposing Gal with order
[2020-05-19 01:37:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:37:39] [INFO ] Removed a total of 114 redundant transitions.
[2020-05-19 01:37:39] [INFO ] Flatten gal took : 70 ms
[2020-05-19 01:37:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2020-05-19 01:37:40] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-19 01:37:40] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --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 10 LTL properties
Checking formula 0 : !(((F("(gi0.gu2.SstopAbort_0>gi0.gu2.AstopAbort_0)"))||(G(!(G("(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)>=2)"))))))
Formula 0 simplified : !(F"(gi0.gu2.SstopAbort_0>gi0.gu2.AstopAbort_0)" | G!G"(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)>=2)")
[2020-05-19 01:37:40] [INFO ] Proved 270 variables to be positive in 633 ms
[2020-05-19 01:37:40] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2020-05-19 01:37:40] [INFO ] Computation of disable matrix completed :0/116 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:40] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:40] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2020-05-19 01:37:40] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:37:42] [INFO ] Computing symmetric co enabling matrix : 116 transitions.
[2020-05-19 01:37:43] [INFO ] Computation of co-enabling matrix(8/116) took 1469 ms. Total solver calls (SAT/UNSAT): 592(592/0)
[2020-05-19 01:37:46] [INFO ] Computation of co-enabling matrix(14/116) took 4854 ms. Total solver calls (SAT/UNSAT): 1105(1105/0)
[2020-05-19 01:37:50] [INFO ] Computation of co-enabling matrix(21/116) took 8270 ms. Total solver calls (SAT/UNSAT): 1658(1658/0)
[2020-05-19 01:37:53] [INFO ] Computation of co-enabling matrix(28/116) took 11551 ms. Total solver calls (SAT/UNSAT): 2162(2162/0)
[2020-05-19 01:37:57] [INFO ] Computation of co-enabling matrix(36/116) took 15087 ms. Total solver calls (SAT/UNSAT): 2678(2678/0)
[2020-05-19 01:38:00] [INFO ] Computation of co-enabling matrix(43/116) took 18335 ms. Total solver calls (SAT/UNSAT): 3077(3077/0)
[2020-05-19 01:38:03] [INFO ] Computation of co-enabling matrix(68/116) took 21885 ms. Total solver calls (SAT/UNSAT): 3848(3519/329)
[2020-05-19 01:38:07] [INFO ] Computation of co-enabling matrix(74/116) took 25466 ms. Total solver calls (SAT/UNSAT): 4079(3750/329)
[2020-05-19 01:38:10] [INFO ] Computation of co-enabling matrix(80/116) took 28756 ms. Total solver calls (SAT/UNSAT): 4274(3945/329)
[2020-05-19 01:38:14] [INFO ] Computation of co-enabling matrix(87/116) took 32213 ms. Total solver calls (SAT/UNSAT): 4456(4127/329)
[2020-05-19 01:38:17] [INFO ] Computation of co-enabling matrix(97/116) took 35385 ms. Total solver calls (SAT/UNSAT): 4622(4293/329)
[2020-05-19 01:38:19] [INFO ] Computation of Finished co-enabling matrix. took 37157 ms. Total solver calls (SAT/UNSAT): 4703(4359/344)
[2020-05-19 01:38:19] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2020-05-19 01:38:22] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-19 01:38:23] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-19 01:38:24] [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 01:38:24] [INFO ] Built C files in 44935ms 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 2002 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 73 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)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.malA3, gi0.gu2.malA2, gi0.malS1i2, gi0.malS4i6, gi0.malS4i5, gi0.malS4i4, gi0.malS4i3, gi0.malS4i1, gi0.malS4i0, malC1i0, malC1i1, malC1i2, malC1i3, malC1i4, malC1i5, malC1i6, malS6i0, malS6i1, malS6i2, malS6i3, malS6i4, malS6i5, malS6i6, malS5i0, malS5i1, malS5i2, malS5i3, malS5i4, malS5i5, malS5i6, malS3i0, malS3i1, malS3i2, malS3i3, malS3i4, malS3i5, malS3i6, malS2i6, malA5, malA4, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/41/103
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
20332 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,203.376,3715760,1,0,357,1.18182e+07,25,354,3579,8.97403e+06,949
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)<=((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6))")))
Formula 1 simplified : !G"(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)<=((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.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
4698 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,250.363,3715760,1,0,518,1.18182e+07,39,549,4724,1.31922e+07,1297
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((F("(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)>=1)"))U("(((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6)>=2)"))U(X(F((("(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)>=1)")U("(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)>=1)"))&&("(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)<1)"))))))
Formula 2 simplified : !((F"(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)>=1)" U "(((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6)>=2)") U XF("(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)<1)" & ("(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)>=1)" U "(((((((gi7.gu22.SstopOK_0+gi7.gu22.SstopOK_1)+gi7.gu22.SstopOK_2)+gi7.gu22.SstopOK_3)+gi7.gu22.SstopOK_4)+gi7.gu22.SstopOK_5)+gi7.gu22.SstopOK_6)>=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
2833 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,278.695,3732516,1,0,789,1.36671e+07,67,892,4851,1.61191e+07,1941
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G("(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)<=gu11.a1_0)"))))
Formula 3 simplified : G"(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)<=gu11.a1_0)"
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
111 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,279.803,3734564,1,0,830,1.38277e+07,76,930,4868,1.63025e+07,2062
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X((X(F("(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)>=2)")))U(("(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)>=2)")U("(gi0.gu0.CstopAbort_0>gi0.gu0.malicious_reservoir_0)"))))))
Formula 4 simplified : !XX(XF"(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)>=2)" U ("(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)>=2)" U "(gi0.gu0.CstopAbort_0>gi0.gu0.malicious_reservoir_0)"))
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
7787 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,357.684,4098568,1,0,1593,1.9338e+07,19,1706,3394,2.55953e+07,173
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(G("(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)<=gu21.a4_0)")))U(G((F(X("(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)<=gu21.a4_0)")))||(G("(gu13.Astart_0>=1)"))))))
Formula 5 simplified : !(!G"(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)<=gu21.a4_0)" U G(FX"(((((((gu21.s6_0+gu21.s6_1)+gu21.s6_2)+gu21.s6_3)+gu21.s6_4)+gu21.s6_5)+gu21.s6_6)<=gu21.a4_0)" | G"(gu13.Astart_0>=1)"))
Computing Next relation with stutter on 4237 deadlock states
145 unique states visited
0 strongly connected components in search stack
202 transitions explored
64 items max in DFS search stack
5012 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,407.811,4099076,1,0,1593,1.9338e+07,40,1706,4661,2.55953e+07,1259
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(!(G("(((((((gu13.n1_0+gu13.n1_1)+gu13.n1_2)+gu13.n1_3)+gu13.n1_4)+gu13.n1_5)+gu13.n1_6)<=((((((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)+gu13.CstopOK_3)+gu13.CstopOK_4)+gu13.CstopOK_5)+gu13.CstopOK_6))")))))))
Formula 6 simplified : !FXG!G"(((((((gu13.n1_0+gu13.n1_1)+gu13.n1_2)+gu13.n1_3)+gu13.n1_4)+gu13.n1_5)+gu13.n1_6)<=((((((gu13.CstopOK_0+gu13.CstopOK_1)+gu13.CstopOK_2)+gu13.CstopOK_3)+gu13.CstopOK_4)+gu13.CstopOK_5)+gu13.CstopOK_6))"
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
202 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,409.906,4099076,1,0,1593,1.9338e+07,49,1706,4773,2.55953e+07,1568
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G(F(G("((gi0.gu0.CstopAbort_0>=2)||(((((((gu12.s2_0+gu12.s2_1)+gu12.s2_2)+gu12.s2_3)+gu12.s2_4)+gu12.s2_5)+gu12.s2_6)<=((((((gu12.n3_0+gu12.n3_1)+gu12.n3_2)+gu12.n3_3)+gu12.n3_4)+gu12.n3_5)+gu12.n3_6)))"))))))
Formula 7 simplified : !FGFG"((gi0.gu0.CstopAbort_0>=2)||(((((((gu12.s2_0+gu12.s2_1)+gu12.s2_2)+gu12.s2_3)+gu12.s2_4)+gu12.s2_5)+gu12.s2_6)<=((((((gu12.n3_0+gu12.n3_1)+gu12.n3_2)+gu12.n3_3)+gu12.n3_4)+gu12.n3_5)+gu12.n3_6)))"
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
2871 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,438.606,4099076,1,0,1593,1.9338e+07,62,1706,5232,2.55953e+07,2575
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((G("(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)"))U(X("(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6))")))&&((("(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)")U("(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6))"))||(("((gi0.gu4.AstopOK_0>=1)&&(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6)))")U("(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)")))))
Formula 8 simplified : !((G"(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)" U X"(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6))") & (("(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)" U "(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6))") | ("((gi0.gu4.AstopOK_0>=1)&&(((((((gi7.gu15.s3_0+gi7.gu15.s3_1)+gi7.gu15.s3_2)+gi7.gu15.s3_3)+gi7.gu15.s3_4)+gi7.gu15.s3_5)+gi7.gu15.s3_6)<=((((((gi7.gu15.s5_0+gi7.gu15.s5_1)+gi7.gu15.s5_2)+gi7.gu15.s5_3)+gi7.gu15.s5_4)+gi7.gu15.s5_5)+gi7.gu15.s5_6)))" U "(((((((((((((((((((((((((((((((((((((((((((((((((gu3.n8_0+gu3.n8_1)+gu3.n8_2)+gu3.n8_3)+gu3.n8_4)+gu3.n8_5)+gu3.n8_6)+gu3.n8_7)+gu3.n8_8)+gu3.n8_9)+gu3.n8_10)+gu3.n8_11)+gu3.n8_12)+gu3.n8_13)+gu3.n8_14)+gu3.n8_15)+gu3.n8_16)+gu3.n8_17)+gu3.n8_18)+gu3.n8_19)+gu3.n8_20)+gu3.n8_21)+gu3.n8_22)+gu3.n8_23)+gu3.n8_24)+gu3.n8_25)+gu3.n8_26)+gu3.n8_27)+gu3.n8_28)+gu3.n8_29)+gu3.n8_30)+gu3.n8_31)+gu3.n8_32)+gu3.n8_33)+gu3.n8_34)+gu3.n8_35)+gu3.n8_36)+gu3.n8_37)+gu3.n8_38)+gu3.n8_39)+gu3.n8_40)+gu3.n8_41)+gu3.n8_42)+gu3.n8_43)+gu3.n8_44)+gu3.n8_45)+gu3.n8_46)+gu3.n8_47)+gu3.n8_48)>=3)")))
Computing Next relation with stutter on 4237 deadlock states
3 unique states visited
0 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,438.686,4099340,1,0,1593,1.9338e+07,92,1706,5380,2.55953e+07,2591
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!((G("(gu11.a1_0>=1)"))U(((F(G("(((((((gu14.c1_0+gu14.c1_1)+gu14.c1_2)+gu14.c1_3)+gu14.c1_4)+gu14.c1_5)+gu14.c1_6)<=((((((gu14.Cstart_0+gu14.Cstart_1)+gu14.Cstart_2)+gu14.Cstart_3)+gu14.Cstart_4)+gu14.Cstart_5)+gu14.Cstart_6))")))||("(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)>gu11.a5_0)"))&&("(gu11.a1_0<1)"))))))
Formula 9 simplified : !F!(G"(gu11.a1_0>=1)" U ("(gu11.a1_0<1)" & ("(((((((gu11.n4_0+gu11.n4_1)+gu11.n4_2)+gu11.n4_3)+gu11.n4_4)+gu11.n4_5)+gu11.n4_6)>gu11.a5_0)" | FG"(((((((gu14.c1_0+gu14.c1_1)+gu14.c1_2)+gu14.c1_3)+gu14.c1_4)+gu14.c1_5)+gu14.c1_6)<=((((((gu14.Cstart_0+gu14.Cstart_1)+gu14.Cstart_2)+gu14.Cstart_3)+gu14.Cstart_4)+gu14.Cstart_5)+gu14.Cstart_6))")))
Computing Next relation with stutter on 4237 deadlock states
45 unique states visited
0 strongly connected components in search stack
47 transitions explored
13 items max in DFS search stack
722 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,445.91,4099472,1,0,1593,1.9338e+07,144,1706,5434,2.55953e+07,3234
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589852735417
--------------------
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-COL-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-COL-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-158961390800729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-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 ;