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-158961390800722.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.6K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 34K 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-02-00
FORMULA_NAME QuasiCertifProtocol-COL-02-01
FORMULA_NAME QuasiCertifProtocol-COL-02-02
FORMULA_NAME QuasiCertifProtocol-COL-02-03
FORMULA_NAME QuasiCertifProtocol-COL-02-04
FORMULA_NAME QuasiCertifProtocol-COL-02-05
FORMULA_NAME QuasiCertifProtocol-COL-02-06
FORMULA_NAME QuasiCertifProtocol-COL-02-07
FORMULA_NAME QuasiCertifProtocol-COL-02-08
FORMULA_NAME QuasiCertifProtocol-COL-02-09
FORMULA_NAME QuasiCertifProtocol-COL-02-10
FORMULA_NAME QuasiCertifProtocol-COL-02-11
FORMULA_NAME QuasiCertifProtocol-COL-02-12
FORMULA_NAME QuasiCertifProtocol-COL-02-13
FORMULA_NAME QuasiCertifProtocol-COL-02-14
FORMULA_NAME QuasiCertifProtocol-COL-02-15

=== Now, execution of the tool begins

BK_START 1589852192266

[2020-05-19 01:36:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:36:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:36:33] [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:36:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2020-05-19 01:36:34] [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:36:34] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 18 ms.
[2020-05-19 01:36:34] [INFO ] Computed order based on color domains.
[2020-05-19 01:36:34] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 5 ms.
[2020-05-19 01:36:34] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16426 resets, run finished after 240 ms. (steps per millisecond=416 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 01:36:34] [INFO ] Computed 31 place invariants in 6 ms
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-05-19 01:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-19 01:36:34] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-05-19 01:36:34] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-05-19 01:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:34] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:34] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2020-05-19 01:36:35] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2020-05-19 01:36:35] [INFO ] Added : 19 causal constraints over 4 iterations in 32 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:35] [INFO ] Added : 19 causal constraints over 4 iterations in 26 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 01:36:35] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:35] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:35] [INFO ] Added : 22 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:35] [INFO ] Added : 22 causal constraints over 5 iterations in 28 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 9 ms.
[2020-05-19 01:36:35] [INFO ] Added : 23 causal constraints over 5 iterations in 41 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:35] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-19 01:36:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-19 01:36:35] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 12 ms.
[2020-05-19 01:36:35] [INFO ] Added : 18 causal constraints over 4 iterations in 43 ms. Result :sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-19 01:36:36] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:36] [INFO ] Added : 25 causal constraints over 5 iterations in 28 ms. Result :sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 01:36:36] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:36] [INFO ] Added : 21 causal constraints over 5 iterations in 34 ms. Result :sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-19 01:36:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:36:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-19 01:36:36] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:36] [INFO ] Added : 23 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 01:36:36] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 01:36:36] [INFO ] Added : 16 causal constraints over 4 iterations in 21 ms. Result :sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-05-19 01:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:36:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-19 01:36:36] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 01:36:36] [INFO ] Added : 24 causal constraints over 5 iterations in 27 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-19 01:36:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 01:36:36] [INFO ] Flatten gal took : 27 ms
FORMULA QuasiCertifProtocol-COL-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:36:36] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 01:36:36] [INFO ] Applying decomposition
[2020-05-19 01:36:36] [INFO ] Flatten gal took : 8 ms
[2020-05-19 01:36:36] [INFO ] Input system was already deterministic with 56 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 01:36:36] [INFO ] Computed 31 place invariants in 2 ms
inv : n7_7 - n7_8 - Cstart_1 + Cstart_2 = 0
inv : SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_0 + SstopOK_1 + SstopOK_2 = 3
inv : CstopAbort_0 + c1_0 + c1_1 + c1_2 + Cstart_0 + Cstart_1 + Cstart_2 + CstopOK_0 + CstopOK_1 + CstopOK_2 = 3
inv : n4_1 - n4_2 + n3_1 - n3_2 = 0
inv : n8_1 - n8_2 + Cstart_1 - Cstart_2 = 0
inv : n6_1 - n6_2 + n5_1 - n5_2 = 0
inv : n7_0 - n7_2 - Cstart_0 + Cstart_2 = 0
inv : n8_3 - n8_5 + Cstart_0 - Cstart_2 = 0
inv : n7_6 - n7_8 - Cstart_0 + Cstart_2 = 0
inv : n9_3 - SstopOK_1 + CstopOK_0 = 0
inv : AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
inv : n9_6 - SstopOK_2 + CstopOK_0 = 0
inv : n8_0 - n8_2 + Cstart_0 - Cstart_2 = 0
inv : n7_1 - n7_2 - Cstart_1 + Cstart_2 = 0
inv : n6_0 - n6_2 + n5_0 - n5_2 = 0
inv : malicious_reservoir_0 + CstopAbort_0 + SstopAbort_0 = 1
inv : n9_5 - SstopOK_1 + CstopOK_2 = 0
inv : n9_8 - SstopOK_2 + CstopOK_2 = 0
inv : n8_4 - n8_5 + Cstart_1 - Cstart_2 = 0
inv : n9_7 - SstopOK_2 + CstopOK_1 = 0
inv : n9_4 - SstopOK_1 + CstopOK_1 = 0
inv : SstopAbort_0 + n9_2 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_2 = 3
inv : n7_3 - n7_5 - Cstart_0 + Cstart_2 = 0
inv : n2_1 - n2_2 + n1_1 - n1_2 = 0
inv : n8_7 - n8_8 + Cstart_1 - Cstart_2 = 0
inv : n2_0 - n2_2 + n1_0 - n1_2 = 0
inv : SstopAbort_0 + n9_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_0 = 3
inv : n7_4 - n7_5 - Cstart_1 + Cstart_2 = 0
inv : n4_0 - n4_2 + n3_0 - n3_2 = 0
inv : SstopAbort_0 + n9_1 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_1 + SstopOK_2 + CstopOK_1 = 3
inv : n8_6 - n8_8 + Cstart_0 - Cstart_2 = 0
Total of 31 invariants.
[2020-05-19 01:36:36] [INFO ] Computed 31 place invariants in 3 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/graph17762291114511077238.txt, -o, /tmp/graph17762291114511077238.bin, -w, /tmp/graph17762291114511077238.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/graph17762291114511077238.bin, -l, -1, -v, -w, /tmp/graph17762291114511077238.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:36:36] [INFO ] Decomposing Gal with order
[2020-05-19 01:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:36:36] [INFO ] Removed a total of 21 redundant transitions.
[2020-05-19 01:36:36] [INFO ] Flatten gal took : 31 ms
[2020-05-19 01:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2020-05-19 01:36:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-19 01:36:36] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((X((G((F("((((u0.malicious_reservoir_0>=1)&&(u0.s2_2>=1))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u6.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u10.s2_1>=1)))"))||(G("((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))"))))&&(G("((((u0.malicious_reservoir_0>=1)&&(u0.s2_2>=1))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u6.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u10.s2_1>=1)))")))))
Formula 0 simplified : !X(G(F"((((u0.malicious_reservoir_0>=1)&&(u0.s2_2>=1))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u6.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u10.s2_1>=1)))" | G"((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))") & G"((((u0.malicious_reservoir_0>=1)&&(u0.s2_2>=1))||((u0.malicious_reservoir_0>=1)&&(i4.i0.u6.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u10.s2_1>=1)))")
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
[2020-05-19 01:36:36] [INFO ] Proved 86 variables to be positive in 209 ms
[2020-05-19 01:36:36] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2020-05-19 01:36:36] [INFO ] Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:36:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:36:36] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2020-05-19 01:36:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions malC1i0, malC1i1, malC1i2, malS6i0, malS6i1, malS5i1, malS5i2, malS3i0, malS3i1, malS2i0, malS2i1, u0.malS3i2, u0.malS2i2, u0.malS1i2, i3.i1.u18.malA5, i3.i1.u18.malA3, i3.i1.u18.malA4, i3.i1.u18.malA2, i3.i1.u18.malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/19/49
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.239911,26104,1,0,18204,1093,1254,32219,355,3878,61154
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))"))U(X(F("(i3.i1.u18.a5_0>=1)")))))
Formula 1 simplified : !(G"((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))" U XF"(i3.i1.u18.a5_0>=1)")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.245708,26560,1,0,18603,1093,1296,32719,357,3883,62910
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G("(i3.i1.u18.a2_0>=1)"))U(X(X(("(i3.i1.u18.a3_0>=1)")U("(i3.i1.u18.a2_0>=1)")))))))
Formula 2 simplified : !F(G"(i3.i1.u18.a2_0>=1)" U XX("(i3.i1.u18.a3_0>=1)" U "(i3.i1.u18.a2_0>=1)"))
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.248166,26824,1,0,18701,1093,1315,32816,358,3883,63467
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((G(F("(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))")))U(F(("(i3.i1.u18.a2_0>=1)")U("(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))"))))U(G((!(G("((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))")))U("(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))")))))
Formula 3 simplified : !((GF"(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))" U F("(i3.i1.u18.a2_0>=1)" U "(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))")) U G(!G"((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))" U "(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))"))
Computing Next relation with stutter on 47 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.332958,29536,1,0,20641,1093,1358,36272,358,3903,75675
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(F(((((F((!(F("(i3.i1.u18.a5_0>=1)")))&&("(i3.i1.u18.a5_0>=1)")))U("(i3.i1.u18.a5_0>=1)"))||("((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))"))||("((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1))"))||("((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1))"))))))
Formula 4 simplified : !F!F("((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1))" | "((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))" | "((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1))" | (F("(i3.i1.u18.a5_0>=1)" & !F"(i3.i1.u18.a5_0>=1)") U "(i3.i1.u18.a5_0>=1)"))
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.473421,33696,1,0,27929,1096,1458,42992,362,3940,102446
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))"))||(F("((((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))||((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1)))||((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1)))"))))
Formula 5 simplified : !(G"((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))" | F"((((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))||((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1)))||((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1)))")
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.476208,33948,1,0,27948,1096,1566,43024,364,3940,102701
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((!(G((X(F(G("(i3.i1.u18.a4_0>=1)"))))||("(i3.i1.u18.a4_0>=1)"))))||(!(G("((((u0.malicious_reservoir_0>=1)&&(i5.u13.s5_1>=1))||((u0.malicious_reservoir_0>=1)&&(i6.u14.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s5_0>=1)))"))))))
Formula 6 simplified : !G(!G("(i3.i1.u18.a4_0>=1)" | XFG"(i3.i1.u18.a4_0>=1)") | !G"((((u0.malicious_reservoir_0>=1)&&(i5.u13.s5_1>=1))||((u0.malicious_reservoir_0>=1)&&(i6.u14.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s5_0>=1)))")
Computing Next relation with stutter on 47 deadlock states
31 unique states visited
0 strongly connected components in search stack
31 transitions explored
31 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.490515,34364,1,0,28091,1096,1591,43120,365,3940,105086
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((!(X(G(((((G("((((i4.i0.u6.n4_0>=1)&&(i3.i1.u7.n4_1>=1))&&(i3.i1.u8.n4_2>=1))&&(i3.i1.u18.a3_0>=1))"))||("((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))"))||("((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1))"))||("((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1))"))U("((((i4.i0.u6.n4_0>=1)&&(i3.i1.u7.n4_1>=1))&&(i3.i1.u8.n4_2>=1))&&(i3.i1.u18.a3_0>=1))")))))||(X("((((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))||((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1)))||((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1)))")))))
Formula 7 simplified : !X(!XG(("((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1))" | "((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1))" | "((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))" | G"((((i4.i0.u6.n4_0>=1)&&(i3.i1.u7.n4_1>=1))&&(i3.i1.u8.n4_2>=1))&&(i3.i1.u18.a3_0>=1))") U "((((i4.i0.u6.n4_0>=1)&&(i3.i1.u7.n4_1>=1))&&(i3.i1.u8.n4_2>=1))&&(i3.i1.u18.a3_0>=1))") | X"((((i4.i1.u11.n1_2>=1)&&(u0.Sstart_2>=1))||((i4.i1.u9.n1_0>=1)&&(i4.i0.u12.Sstart_0>=1)))||((i4.i1.u10.n1_1>=1)&&(i4.i1.u10.Sstart_1>=1)))")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.492992,34720,1,0,28093,1096,1640,43124,367,3940,105134
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(((X("((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))"))||("(i3.i1.u18.a5_0>=1)"))&&(G("((((i4.i0.u12.n2_0>=1)&&(i4.i1.u10.n2_1>=1))&&(i4.i1.u11.n2_2>=1))&&(i3.i1.u18.a1_0>=1))"))))||(F("(((((((i3.i1.u8.n3_2>=1)&&(u0.s2_2>=1))||((i3.i1.u7.n3_1>=1)&&(i4.i1.u10.s2_1>=1)))||((i4.i0.u6.n3_0>=1)&&(i4.i0.u6.s2_0>=1)))||((i5.u4.n5_1>=1)&&(i5.u4.s3_1>=1)))||((i3.i0.u5.n5_2>=1)&&(u0.s3_2>=1)))||((i3.i0.u3.n5_0>=1)&&(i4.i0.u6.s3_0>=1)))"))))
Formula 8 simplified : !(G(("(i3.i1.u18.a5_0>=1)" | X"((((u0.malicious_reservoir_0>=1)&&(i6.u14.s4_2>=1))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s4_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.u13.s4_1>=1)))") & G"((((i4.i0.u12.n2_0>=1)&&(i4.i1.u10.n2_1>=1))&&(i4.i1.u11.n2_2>=1))&&(i3.i1.u18.a1_0>=1))") | F"(((((((i3.i1.u8.n3_2>=1)&&(u0.s2_2>=1))||((i3.i1.u7.n3_1>=1)&&(i4.i1.u10.s2_1>=1)))||((i4.i0.u6.n3_0>=1)&&(i4.i0.u6.s2_0>=1)))||((i5.u4.n5_1>=1)&&(i5.u4.s3_1>=1)))||((i3.i0.u5.n5_2>=1)&&(u0.s3_2>=1)))||((i3.i0.u3.n5_0>=1)&&(i4.i0.u6.s3_0>=1)))")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.500025,34720,1,0,28451,1096,1754,43726,372,3940,106791
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(G("((((((i1.u1.n9_2>=1)&&(i1.u1.n9_5>=1))&&(i1.u1.n9_8>=1))&&(i1.u1.c1_2>=1))||((((i2.u20.n9_1>=1)&&(i2.u20.n9_4>=1))&&(i2.u20.n9_7>=1))&&(i2.u20.c1_1>=1)))||((((i6.u19.n9_0>=1)&&(i6.u19.n9_3>=1))&&(i6.u19.n9_6>=1))&&(i6.u19.c1_0>=1)))")))||(G((((X("(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))"))||(F("(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))")))&&("(i3.i1.u18.a4_0>=1)"))U(F("(i3.i1.u18.a1_0>=1)"))))))
Formula 9 simplified : !(XG"((((((i1.u1.n9_2>=1)&&(i1.u1.n9_5>=1))&&(i1.u1.n9_8>=1))&&(i1.u1.c1_2>=1))||((((i2.u20.n9_1>=1)&&(i2.u20.n9_4>=1))&&(i2.u20.n9_7>=1))&&(i2.u20.c1_1>=1)))||((((i6.u19.n9_0>=1)&&(i6.u19.n9_3>=1))&&(i6.u19.n9_6>=1))&&(i6.u19.c1_0>=1)))" | G(("(i3.i1.u18.a4_0>=1)" & (X"(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))" | F"(((i5.u13.s4_1>=1)||(i2.u2.s4_0>=1))||(i6.u14.s4_2>=1))")) U F"(i3.i1.u18.a1_0>=1)"))
Computing Next relation with stutter on 47 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.515926,34944,1,0,28670,1096,1836,44244,379,3940,109015
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((((((((X("(i3.i1.u18.a2_0>=1)"))U("((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))"))||(G("(i3.i1.u18.a2_0>=1)")))||("((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))"))||("((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1))"))||("((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1))"))||("((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))"))U("((((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))||((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1)))||((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1)))")))
Formula 10 simplified : !(("((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1))" | "((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))" | "((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))" | "((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1))" | (X"(i3.i1.u18.a2_0>=1)" U "((((i3.i0.u3.n6_0>=1)&&(i5.u4.n6_1>=1))&&(i3.i0.u5.n6_2>=1))&&(i3.i1.u18.a5_0>=1))") | G"(i3.i1.u18.a2_0>=1)") U "((((((i2.u16.n8_0>=1)&&(i2.u16.n8_1>=1))&&(i2.u16.n8_2>=1))&&(i2.u2.s5_0>=1))||((((i1.u17.n8_3>=1)&&(i1.u17.n8_4>=1))&&(i1.u17.n8_5>=1))&&(i5.u13.s5_1>=1)))||((((i6.u15.n8_6>=1)&&(i6.u15.n8_7>=1))&&(i6.u15.n8_8>=1))&&(i6.u14.s5_2>=1)))")
Computing Next relation with stutter on 47 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.556135,35920,1,0,30331,1096,1872,46029,379,3940,115714
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(X((X("((((((i2.u2.n7_1>=1)&&(i5.u13.n7_4>=1))&&(i6.u14.n7_7>=1))&&(i2.u20.Cstart_1>=1))||((((i2.u2.n7_0>=1)&&(i5.u13.n7_3>=1))&&(i6.u14.n7_6>=1))&&(i6.u19.Cstart_0>=1)))||((((i2.u2.n7_2>=1)&&(i5.u13.n7_5>=1))&&(i6.u14.n7_8>=1))&&(i1.u1.Cstart_2>=1)))"))&&(!((("((((u0.malicious_reservoir_0>=1)&&(i2.u20.c1_1>=1))||((u0.malicious_reservoir_0>=1)&&(i1.u1.c1_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.u19.c1_0>=1)))")U("(i3.i1.u18.a2_0>=1)"))U("((((((i2.u2.n7_1>=1)&&(i5.u13.n7_4>=1))&&(i6.u14.n7_7>=1))&&(i2.u20.Cstart_1>=1))||((((i2.u2.n7_0>=1)&&(i5.u13.n7_3>=1))&&(i6.u14.n7_6>=1))&&(i6.u19.Cstart_0>=1)))||((((i2.u2.n7_2>=1)&&(i5.u13.n7_5>=1))&&(i6.u14.n7_8>=1))&&(i1.u1.Cstart_2>=1)))"))))))))
Formula 11 simplified : !GFX(X"((((((i2.u2.n7_1>=1)&&(i5.u13.n7_4>=1))&&(i6.u14.n7_7>=1))&&(i2.u20.Cstart_1>=1))||((((i2.u2.n7_0>=1)&&(i5.u13.n7_3>=1))&&(i6.u14.n7_6>=1))&&(i6.u19.Cstart_0>=1)))||((((i2.u2.n7_2>=1)&&(i5.u13.n7_5>=1))&&(i6.u14.n7_8>=1))&&(i1.u1.Cstart_2>=1)))" & !(("((((u0.malicious_reservoir_0>=1)&&(i2.u20.c1_1>=1))||((u0.malicious_reservoir_0>=1)&&(i1.u1.c1_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.u19.c1_0>=1)))" U "(i3.i1.u18.a2_0>=1)") U "((((((i2.u2.n7_1>=1)&&(i5.u13.n7_4>=1))&&(i6.u14.n7_7>=1))&&(i2.u20.Cstart_1>=1))||((((i2.u2.n7_0>=1)&&(i5.u13.n7_3>=1))&&(i6.u14.n7_6>=1))&&(i6.u19.Cstart_0>=1)))||((((i2.u2.n7_2>=1)&&(i5.u13.n7_5>=1))&&(i6.u14.n7_8>=1))&&(i1.u1.Cstart_2>=1)))"))
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.56137,36180,1,0,30332,1096,1953,46030,379,3940,116143
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(((G("((((u0.malicious_reservoir_0>=1)&&(i5.u13.s5_1>=1))||((u0.malicious_reservoir_0>=1)&&(i6.u14.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s5_0>=1)))"))&&(!(F("(i3.i1.u18.a4_0>=1)"))))&&(!(F("(i3.i1.u18.a2_0>=1)")))))))
Formula 12 simplified : !GX(G"((((u0.malicious_reservoir_0>=1)&&(i5.u13.s5_1>=1))||((u0.malicious_reservoir_0>=1)&&(i6.u14.s5_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.u2.s5_0>=1)))" & !F"(i3.i1.u18.a4_0>=1)" & !F"(i3.i1.u18.a2_0>=1)")
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.563311,36180,1,0,30332,1096,1994,46030,384,3940,116164
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 01:36:37] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-19 01:36:37] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-19 01:36:37] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 0) 1) (>= (select s0 49) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 49 (- (select s0 49) 1)) 1 (+ (select s0 1) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 0) 1) (>= (select s0 49) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 49 (- (select s0 49) 1)) 1 (+ (select s0 1) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:36:37] [INFO ] Built C files in 838ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589852197715

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-02"
export BK_EXAMINATION="LTLFireability"
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-02, examination is LTLFireability"
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-158961390800722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;