Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200085.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 630K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 186K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 290K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-00
FORMULA_NAME QuasiCertifProtocol-PT-10-01
FORMULA_NAME QuasiCertifProtocol-PT-10-02
FORMULA_NAME QuasiCertifProtocol-PT-10-03
FORMULA_NAME QuasiCertifProtocol-PT-10-04
FORMULA_NAME QuasiCertifProtocol-PT-10-05
FORMULA_NAME QuasiCertifProtocol-PT-10-06
FORMULA_NAME QuasiCertifProtocol-PT-10-07
FORMULA_NAME QuasiCertifProtocol-PT-10-08
FORMULA_NAME QuasiCertifProtocol-PT-10-09
FORMULA_NAME QuasiCertifProtocol-PT-10-10
FORMULA_NAME QuasiCertifProtocol-PT-10-11
FORMULA_NAME QuasiCertifProtocol-PT-10-12
FORMULA_NAME QuasiCertifProtocol-PT-10-13
FORMULA_NAME QuasiCertifProtocol-PT-10-14
FORMULA_NAME QuasiCertifProtocol-PT-10-15

=== Now, execution of the tool begins

BK_START 1621235794011

Running Version 0
[2021-05-17 07:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 07:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:16:36] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-17 07:16:36] [INFO ] Transformed 550 places.
[2021-05-17 07:16:36] [INFO ] Transformed 176 transitions.
[2021-05-17 07:16:36] [INFO ] Parsed PT model containing 550 places and 176 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 117 out of 550 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 99 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2021-05-17 07:16:36] [INFO ] Computed 350 place invariants in 56 ms
[2021-05-17 07:16:37] [INFO ] Implicit Places using invariants in 712 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2021-05-17 07:16:37] [INFO ] Computed 350 place invariants in 19 ms
[2021-05-17 07:16:37] [INFO ] Implicit Places using invariants and state equation in 576 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1350 ms to find 11 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:37] [INFO ] Computed 340 place invariants in 51 ms
[2021-05-17 07:16:37] [INFO ] Dead Transitions using invariants and state equation in 216 ms returned []
Starting structural reductions, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:37] [INFO ] Computed 340 place invariants in 36 ms
[2021-05-17 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 2 iterations. Remains : 513/550 places, 176/176 transitions.
[2021-05-17 07:16:38] [INFO ] Flatten gal took : 84 ms
[2021-05-17 07:16:38] [INFO ] Flatten gal took : 33 ms
[2021-05-17 07:16:38] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 100000 steps, including 6922 resets, run finished after 406 ms. (steps per millisecond=246 ) properties (out of 23) seen :6
Running SMT prover for 17 properties.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:39] [INFO ] Computed 340 place invariants in 59 ms
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 68 ms returned sat
[2021-05-17 07:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using state equation in 122 ms returned unsat
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 50 ms returned sat
[2021-05-17 07:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-17 07:16:39] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2021-05-17 07:16:39] [INFO ] Added : 11 causal constraints over 3 iterations in 113 ms. Result :sat
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2021-05-17 07:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:39] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-17 07:16:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:40] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 59 ms returned sat
[2021-05-17 07:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:40] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-17 07:16:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2021-05-17 07:16:40] [INFO ] Added : 56 causal constraints over 12 iterations in 217 ms. Result :sat
[2021-05-17 07:16:40] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 48 ms returned sat
[2021-05-17 07:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:40] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-17 07:16:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 07:16:40] [INFO ] Added : 12 causal constraints over 3 iterations in 72 ms. Result :sat
[2021-05-17 07:16:40] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:40] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-17 07:16:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2021-05-17 07:16:41] [INFO ] Added : 46 causal constraints over 10 iterations in 173 ms. Result :sat
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2021-05-17 07:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-17 07:16:41] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 19 ms.
[2021-05-17 07:16:41] [INFO ] Added : 18 causal constraints over 4 iterations in 102 ms. Result :sat
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 50 ms returned sat
[2021-05-17 07:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using state equation in 87 ms returned unsat
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2021-05-17 07:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:41] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-17 07:16:41] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 20 ms.
[2021-05-17 07:16:42] [INFO ] Added : 23 causal constraints over 5 iterations in 116 ms. Result :sat
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2021-05-17 07:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-17 07:16:42] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2021-05-17 07:16:42] [INFO ] Added : 24 causal constraints over 5 iterations in 108 ms. Result :sat
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 50 ms returned sat
[2021-05-17 07:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-17 07:16:42] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2021-05-17 07:16:42] [INFO ] Added : 46 causal constraints over 10 iterations in 183 ms. Result :sat
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 40 ms returned sat
[2021-05-17 07:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:42] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-17 07:16:42] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2021-05-17 07:16:43] [INFO ] Added : 23 causal constraints over 5 iterations in 114 ms. Result :sat
[2021-05-17 07:16:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 58 ms returned sat
[2021-05-17 07:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:43] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-17 07:16:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2021-05-17 07:16:43] [INFO ] Added : 23 causal constraints over 5 iterations in 90 ms. Result :sat
[2021-05-17 07:16:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:43] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-17 07:16:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 9 ms.
[2021-05-17 07:16:43] [INFO ] Added : 46 causal constraints over 10 iterations in 167 ms. Result :sat
[2021-05-17 07:16:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-17 07:16:44] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 07:16:44] [INFO ] Added : 14 causal constraints over 3 iterations in 66 ms. Result :sat
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-17 07:16:44] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 8 ms.
[2021-05-17 07:16:44] [INFO ] Added : 46 causal constraints over 10 iterations in 155 ms. Result :sat
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2021-05-17 07:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-17 07:16:44] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 07:16:44] [INFO ] Added : 46 causal constraints over 10 iterations in 156 ms. Result :sat
[2021-05-17 07:16:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2021-05-17 07:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:45] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-17 07:16:45] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 07:16:45] [INFO ] Added : 35 causal constraints over 7 iterations in 136 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2021-05-17 07:16:45] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-PT-10-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&(X(G(p1))||(p2 U G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:45] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 07:16:45] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:45] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 07:16:46] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:46] [INFO ] Computed 340 place invariants in 20 ms
[2021-05-17 07:16:46] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p0), (NOT p0), (NOT p1), false, false, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s76 1), p2:(OR (GEQ s15 1) (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1)), p0:(GEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-01 finished in 1855 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(G(p1)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 46 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:47] [INFO ] Computed 340 place invariants in 17 ms
[2021-05-17 07:16:47] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:47] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 07:16:47] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:47] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:16:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s62 1) (GEQ s458 1)) (AND (GEQ s66 1) (GEQ s462 1)) (AND (GEQ s61 1) (GEQ s457 1)) (AND (GEQ s65 1) (GEQ s461 1)) (AND (GEQ s60 1) (GEQ s456 1)) (AND (GEQ s64 1) (GEQ s460 1)) (AND (GEQ s56 1) (GEQ s465 1)) (AND (GEQ s55 1) (GEQ s466 1)) (AND (GEQ s59 1) (GEQ s463 1)) (AND (GEQ s63 1) (GEQ s467 1)) (AND (GEQ s57 1) (GEQ s464 1))), p1:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s16 1)) (OR (LT s0 1) (LT s15 1)) (OR (LT s0 1) (LT s18 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s12 1)) (OR (LT s0 1) (LT s14 1)) (OR (LT s0 1) (LT s13 1)) (OR (LT s0 1) (LT s22 1))), p2:(AND (GEQ s87 1) (GEQ s468 1) (GEQ s469 1) (GEQ s470 1) (GEQ s471 1) (GEQ s472 1) (GEQ s473 1) (GEQ s474 1) (GEQ s475 1) (GEQ s476 1) (GEQ s478 1) (GEQ s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-02 finished in 1204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:48] [INFO ] Computed 340 place invariants in 33 ms
[2021-05-17 07:16:48] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:48] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:16:49] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:49] [INFO ] Computed 340 place invariants in 17 ms
[2021-05-17 07:16:49] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 89 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-10-03 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s16 1)) (OR (LT s0 1) (LT s15 1)) (OR (LT s0 1) (LT s18 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s12 1)) (OR (LT s0 1) (LT s14 1)) (OR (LT s0 1) (LT s13 1)) (OR (LT s0 1) (LT s22 1))), p0:(AND (GEQ s75 1) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s16 1)) (OR (LT s0 1) (LT s15 1)) (OR (LT s0 1) (LT s18 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s12 1)) (OR (LT s0 1) (LT s14 1)) (OR (LT s0 1) (LT s13 1)) (OR (LT s0 1) (LT s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-03 finished in 1435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 22 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:49] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:16:50] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:50] [INFO ] Computed 340 place invariants in 45 ms
[2021-05-17 07:16:50] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:50] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 07:16:50] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s70 1) (LT s480 1)) (OR (LT s68 1) (LT s421 1)) (OR (LT s72 1) (LT s425 1)) (OR (LT s69 1) (LT s481 1)) (OR (LT s81 1) (LT s477 1)) (OR (LT s74 1) (LT s423 1)) (OR (LT s73 1) (LT s422 1)) (OR (LT s67 1) (LT s420 1)) (OR (LT s71 1) (LT s424 1)) (OR (LT s79 1) (LT s483 1)) (OR (LT s78 1) (LT s482 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-04 finished in 1204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 23 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 175
Applied a total of 2 rules in 64 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:16:51] [INFO ] Computed 340 place invariants in 19 ms
[2021-05-17 07:16:51] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:16:51] [INFO ] Computed 340 place invariants in 35 ms
[2021-05-17 07:16:52] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2021-05-17 07:16:52] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:16:52] [INFO ] Computed 340 place invariants in 29 ms
[2021-05-17 07:16:52] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s70 1) (LT s479 1)) (OR (LT s68 1) (LT s420 1)) (OR (LT s72 1) (LT s424 1)) (OR (LT s69 1) (LT s480 1)) (OR (LT s80 1) (LT s476 1)) (OR (LT s74 1) (LT s422 1)) (OR (LT s73 1) (LT s421 1)) (OR (LT s67 1) (LT s419 1)) (OR (LT s71 1) (LT s423 1)) (OR (LT s78 1) (LT s482 1)) (OR (LT s77 1) (LT s481 1))), p1:(LT s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6917 reset in 486 ms.
Product exploration explored 100000 steps with 6923 reset in 293 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-PT-10-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-10-05 finished in 2818 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 22 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:53] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 07:16:54] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:54] [INFO ] Computed 340 place invariants in 19 ms
[2021-05-17 07:16:54] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:16:54] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:16:55] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s52 1) (LT s495 1)) (OR (LT s43 1) (LT s488 1)) (OR (LT s51 1) (LT s496 1)) (OR (LT s53 1) (LT s494 1)) (OR (LT s44 1) (LT s487 1)) (OR (LT s54 1) (LT s493 1)) (OR (LT s47 1) (LT s500 1)) (OR (LT s48 1) (LT s499 1)) (OR (LT s49 1) (LT s498 1)) (OR (LT s58 1) (LT s506 1)) (OR (LT s50 1) (LT s497 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6923 reset in 369 ms.
Product exploration explored 100000 steps with 6919 reset in 296 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6929 reset in 246 ms.
Product exploration explored 100000 steps with 6914 reset in 260 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 22 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 62 ms. Remains 513 /513 variables (removed 0) and now considering 177/176 (removed -1) transitions.
[2021-05-17 07:16:56] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 177 rows 513 cols
[2021-05-17 07:16:56] [INFO ] Computed 340 place invariants in 17 ms
[2021-05-17 07:16:57] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 177/176 transitions.
Product exploration explored 100000 steps with 6922 reset in 576 ms.
Product exploration explored 100000 steps with 6917 reset in 439 ms.
[2021-05-17 07:16:58] [INFO ] Flatten gal took : 25 ms
[2021-05-17 07:16:58] [INFO ] Flatten gal took : 22 ms
[2021-05-17 07:16:58] [INFO ] Time to serialize gal into /tmp/LTL15431778637569960705.gal : 10 ms
[2021-05-17 07:16:58] [INFO ] Time to serialize properties into /tmp/LTL13186436496208745789.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15431778637569960705.gal, -t, CGAL, -LTL, /tmp/LTL13186436496208745789.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15431778637569960705.gal -t CGAL -LTL /tmp/LTL13186436496208745789.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((((((((((s3_8<1)||(n5_8<1))&&((s3_1<1)||(n5_1<1)))&&((s3_9<1)||(n5_9<1)))&&((s3_7<1)||(n5_7<1)))&&((s3_0<1)||(n5_0<1)))&&((s3_6<1)||(n5_6<1)))&&((s3_5<1)||(n5_5<1)))&&((s3_4<1)||(n5_4<1)))&&((s3_3<1)||(n5_3<1)))&&((s3_10<1)||(n5_10<1)))&&((s3_2<1)||(n5_2<1)))")))))
Formula 0 simplified : !XXG"((((((((((((s3_8<1)||(n5_8<1))&&((s3_1<1)||(n5_1<1)))&&((s3_9<1)||(n5_9<1)))&&((s3_7<1)||(n5_7<1)))&&((s3_0<1)||(n5_0<1)))&&((s3_6<1)||(n5_6<1)))&&((s3_5<1)||(n5_5<1)))&&((s3_4<1)||(n5_4<1)))&&((s3_3<1)||(n5_3<1)))&&((s3_10<1)||(n5_10<1)))&&((s3_2<1)||(n5_2<1)))"
Detected timeout of ITS tools.
[2021-05-17 07:17:13] [INFO ] Flatten gal took : 23 ms
[2021-05-17 07:17:13] [INFO ] Applying decomposition
[2021-05-17 07:17:13] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16261777799317935638.txt, -o, /tmp/graph16261777799317935638.bin, -w, /tmp/graph16261777799317935638.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16261777799317935638.bin, -l, -1, -v, -w, /tmp/graph16261777799317935638.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:17:13] [INFO ] Decomposing Gal with order
[2021-05-17 07:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:17:13] [INFO ] Removed a total of 109 redundant transitions.
[2021-05-17 07:17:13] [INFO ] Flatten gal took : 104 ms
[2021-05-17 07:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 22 ms.
[2021-05-17 07:17:13] [INFO ] Time to serialize gal into /tmp/LTL5936126962900369726.gal : 9 ms
[2021-05-17 07:17:13] [INFO ] Time to serialize properties into /tmp/LTL9467948583054086054.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5936126962900369726.gal, -t, CGAL, -LTL, /tmp/LTL9467948583054086054.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5936126962900369726.gal -t CGAL -LTL /tmp/LTL9467948583054086054.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((((((((((i21.i1.u67.s3_8<1)||(i21.i1.u67.n5_8<1))&&((i20.i1.u66.s3_1<1)||(i20.i1.u66.n5_1<1)))&&((i14.u58.s3_9<1)||(i14.u58.n5_9<1)))&&((i17.i1.u57.s3_7<1)||(i17.i1.u57.n5_7<1)))&&((i12.i0.u64.s3_0<1)||(i12.i0.u64.n5_0<1)))&&((i16.u56.s3_6<1)||(i16.u56.n5_6<1)))&&((i19.i1.u63.s3_5<1)||(i19.i1.u63.n5_5<1)))&&((i15.i0.u20.s3_4<1)||(i15.i0.u20.n5_4<1)))&&((i13.i1.u60.s3_3<1)||(i13.i1.u60.n5_3<1)))&&((i22.i1.u68.s3_10<1)||(i22.i1.u68.n5_10<1)))&&((i18.i1.u59.s3_2<1)||(i18.i1.u59.n5_2<1)))")))))
Formula 0 simplified : !XXG"((((((((((((i21.i1.u67.s3_8<1)||(i21.i1.u67.n5_8<1))&&((i20.i1.u66.s3_1<1)||(i20.i1.u66.n5_1<1)))&&((i14.u58.s3_9<1)||(i14.u58.n5_9<1)))&&((i17.i1.u57.s3_7<1)||(i17.i1.u57.n5_7<1)))&&((i12.i0.u64.s3_0<1)||(i12.i0.u64.n5_0<1)))&&((i16.u56.s3_6<1)||(i16.u56.n5_6<1)))&&((i19.i1.u63.s3_5<1)||(i19.i1.u63.n5_5<1)))&&((i15.i0.u20.s3_4<1)||(i15.i0.u20.n5_4<1)))&&((i13.i1.u60.s3_3<1)||(i13.i1.u60.n5_3<1)))&&((i22.i1.u68.s3_10<1)||(i22.i1.u68.n5_10<1)))&&((i18.i1.u59.s3_2<1)||(i18.i1.u59.n5_2<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10948295123401856592
[2021-05-17 07:17:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10948295123401856592
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10948295123401856592]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10948295123401856592] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10948295123401856592] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-10-06 finished in 36016 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 175
Applied a total of 2 rules in 85 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:17:29] [INFO ] Computed 340 place invariants in 32 ms
[2021-05-17 07:17:30] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:17:30] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:17:31] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2021-05-17 07:17:31] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:17:31] [INFO ] Computed 340 place invariants in 13 ms
[2021-05-17 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s76 1), p1:(LT s483 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13668 reset in 383 ms.
Product exploration explored 100000 steps with 13653 reset in 278 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13705 reset in 213 ms.
Product exploration explored 100000 steps with 13770 reset in 224 ms.
[2021-05-17 07:17:32] [INFO ] Flatten gal took : 18 ms
[2021-05-17 07:17:33] [INFO ] Flatten gal took : 16 ms
[2021-05-17 07:17:33] [INFO ] Time to serialize gal into /tmp/LTL6732006617923173101.gal : 2 ms
[2021-05-17 07:17:33] [INFO ] Time to serialize properties into /tmp/LTL13947944403296911930.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6732006617923173101.gal, -t, CGAL, -LTL, /tmp/LTL13947944403296911930.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6732006617923173101.gal -t CGAL -LTL /tmp/LTL13947944403296911930.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(a2<1)"))&&(G(F("(Astart<1)")))))
Formula 0 simplified : !(F"(a2<1)" & GF"(Astart<1)")
Detected timeout of ITS tools.
[2021-05-17 07:17:48] [INFO ] Flatten gal took : 19 ms
[2021-05-17 07:17:48] [INFO ] Applying decomposition
[2021-05-17 07:17:48] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13547890367537939764.txt, -o, /tmp/graph13547890367537939764.bin, -w, /tmp/graph13547890367537939764.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13547890367537939764.bin, -l, -1, -v, -w, /tmp/graph13547890367537939764.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:17:48] [INFO ] Decomposing Gal with order
[2021-05-17 07:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:17:48] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-17 07:17:48] [INFO ] Flatten gal took : 57 ms
[2021-05-17 07:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 14 ms.
[2021-05-17 07:17:48] [INFO ] Time to serialize gal into /tmp/LTL11918997604643576814.gal : 7 ms
[2021-05-17 07:17:48] [INFO ] Time to serialize properties into /tmp/LTL5003148398187727040.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11918997604643576814.gal, -t, CGAL, -LTL, /tmp/LTL5003148398187727040.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11918997604643576814.gal -t CGAL -LTL /tmp/LTL5003148398187727040.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i9.i0.u28.a2<1)"))&&(G(F("(i9.i0.u30.Astart<1)")))))
Formula 0 simplified : !(F"(i9.i0.u28.a2<1)" & GF"(i9.i0.u30.Astart<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12929007912316499051
[2021-05-17 07:18:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12929007912316499051
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12929007912316499051]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12929007912316499051] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12929007912316499051] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-10-07 finished in 34493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1||G(p0))) U p2))], workingDir=/home/mcc/execution]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 32 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:18:04] [INFO ] Computed 340 place invariants in 36 ms
[2021-05-17 07:18:04] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:18:04] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 07:18:05] [INFO ] Implicit Places using invariants and state equation in 778 ms returned [420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1291 ms to find 11 implicit places.
[2021-05-17 07:18:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2021-05-17 07:18:05] [INFO ] Computed 330 place invariants in 18 ms
[2021-05-17 07:18:05] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Starting structural reductions, iteration 1 : 501/513 places, 175/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 501 /501 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2021-05-17 07:18:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2021-05-17 07:18:05] [INFO ] Computed 330 place invariants in 21 ms
[2021-05-17 07:18:06] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 2 iterations. Remains : 501/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-08 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s76 1), p1:(AND (GEQ s77 1) (LT s18 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24535 steps with 1667 reset in 91 ms.
FORMULA QuasiCertifProtocol-PT-10-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-08 finished in 1966 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 63 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 07:18:06] [INFO ] Computed 340 place invariants in 41 ms
[2021-05-17 07:18:06] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 07:18:06] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 07:18:07] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 985 ms to find 11 implicit places.
[2021-05-17 07:18:07] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 07:18:07] [INFO ] Computed 330 place invariants in 43 ms
[2021-05-17 07:18:07] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Starting structural reductions, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2021-05-17 07:18:07] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 07:18:07] [INFO ] Computed 330 place invariants in 38 ms
[2021-05-17 07:18:07] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Finished structural reductions, in 2 iterations. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s75 1) (GEQ s445 1) (GEQ s446 1) (GEQ s447 1) (GEQ s448 1) (GEQ s452 1) (GEQ s472 1) (GEQ s473 1) (GEQ s476 1) (GEQ s477 1) (GEQ s478 1) (GEQ s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-09 finished in 1604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((X((p1||F(!p2)||G(!p3)))||p0)))))], workingDir=/home/mcc/execution]
Support contains 14 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:07] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:18:08] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:08] [INFO ] Computed 340 place invariants in 37 ms
[2021-05-17 07:18:08] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:08] [INFO ] Computed 340 place invariants in 37 ms
[2021-05-17 07:18:09] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p0) (NOT p1) p2 p3), (AND (NOT p0) (NOT p1) p2 p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s87 1) (LT s468 1) (LT s469 1) (LT s470 1) (LT s471 1) (LT s472 1) (LT s473 1) (LT s474 1) (LT s475 1) (LT s476 1) (LT s478 1) (LT s479 1)), p1:(LT s21 1), p2:(LT s484 1), p3:(AND (GEQ s87 1) (GEQ s468 1) (GEQ s469 1) (GEQ s470 1) (GEQ s471 1) (GEQ s472 1) (GEQ s473 1) (GEQ s474 1) (GEQ s475 1) (GEQ s476 1) (GEQ s478 1) (GEQ s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Product exploration explored 100000 steps with 33333 reset in 376 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (F (G p2)), (F (G (NOT p3))), p0, p1, (NOT p2), (NOT p3)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-PT-10-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-10-10 finished in 2566 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(!p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:18:10] [INFO ] Computed 340 place invariants in 26 ms
[2021-05-17 07:18:10] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 07:18:10] [INFO ] Computed 340 place invariants in 17 ms
[2021-05-17 07:18:11] [INFO ] Implicit Places using invariants and state equation in 711 ms returned [420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1178 ms to find 11 implicit places.
[2021-05-17 07:18:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2021-05-17 07:18:11] [INFO ] Computed 330 place invariants in 25 ms
[2021-05-17 07:18:11] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Starting structural reductions, iteration 1 : 501/513 places, 175/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 501 /501 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2021-05-17 07:18:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 175 rows 501 cols
[2021-05-17 07:18:11] [INFO ] Computed 330 place invariants in 42 ms
[2021-05-17 07:18:12] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 2 iterations. Remains : 501/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 91 ms :[p1, (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-11 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LT s77 1), p0:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-11 finished in 1770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((!p0||(p1&&X((p1 U (p2||G(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:12] [INFO ] Computed 340 place invariants in 34 ms
[2021-05-17 07:18:12] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:12] [INFO ] Computed 340 place invariants in 23 ms
[2021-05-17 07:18:13] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:13] [INFO ] Computed 340 place invariants in 39 ms
[2021-05-17 07:18:13] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-10-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s76 1), p1:(LT s77 1), p2:(LT s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6918 reset in 143 ms.
Product exploration explored 100000 steps with 6921 reset in 151 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (F (G p2)), (NOT p0), p1, p2]
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Product exploration explored 100000 steps with 6931 reset in 148 ms.
Product exploration explored 100000 steps with 6928 reset in 152 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 210 ms :[(AND p0 (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Support contains 3 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2021-05-17 07:18:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:15] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:18:15] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Product exploration explored 100000 steps with 6919 reset in 316 ms.
Product exploration explored 100000 steps with 6924 reset in 462 ms.
[2021-05-17 07:18:16] [INFO ] Flatten gal took : 32 ms
[2021-05-17 07:18:16] [INFO ] Flatten gal took : 25 ms
[2021-05-17 07:18:16] [INFO ] Time to serialize gal into /tmp/LTL2889872447694903864.gal : 5 ms
[2021-05-17 07:18:16] [INFO ] Time to serialize properties into /tmp/LTL2948631262619639435.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2889872447694903864.gal, -t, CGAL, -LTL, /tmp/LTL2948631262619639435.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2889872447694903864.gal -t CGAL -LTL /tmp/LTL2948631262619639435.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(a2<1)")||(("(a4<1)")&&(X(("(a4<1)")U(("(a3<1)")||(G("(a4<1)")))))))))))
Formula 0 simplified : !XXG("(a2<1)" | ("(a4<1)" & X("(a4<1)" U ("(a3<1)" | G"(a4<1)"))))
Detected timeout of ITS tools.
[2021-05-17 07:18:31] [INFO ] Flatten gal took : 29 ms
[2021-05-17 07:18:31] [INFO ] Applying decomposition
[2021-05-17 07:18:31] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8613578533813905469.txt, -o, /tmp/graph8613578533813905469.bin, -w, /tmp/graph8613578533813905469.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8613578533813905469.bin, -l, -1, -v, -w, /tmp/graph8613578533813905469.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:18:31] [INFO ] Decomposing Gal with order
[2021-05-17 07:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:18:31] [INFO ] Removed a total of 109 redundant transitions.
[2021-05-17 07:18:31] [INFO ] Flatten gal took : 43 ms
[2021-05-17 07:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 9 ms.
[2021-05-17 07:18:31] [INFO ] Time to serialize gal into /tmp/LTL4641705343139575690.gal : 7 ms
[2021-05-17 07:18:31] [INFO ] Time to serialize properties into /tmp/LTL4306431443670444017.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4641705343139575690.gal, -t, CGAL, -LTL, /tmp/LTL4306431443670444017.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4641705343139575690.gal -t CGAL -LTL /tmp/LTL4306431443670444017.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i9.i1.u30.a2<1)")||(("(i14.i0.u32.a4<1)")&&(X(("(i14.i0.u32.a4<1)")U(("(i9.i1.u30.a3<1)")||(G("(i14.i0.u32.a4<1)")))))))))))
Formula 0 simplified : !XXG("(i9.i1.u30.a2<1)" | ("(i14.i0.u32.a4<1)" & X("(i14.i0.u32.a4<1)" U ("(i9.i1.u30.a3<1)" | G"(i14.i0.u32.a4<1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin219506398762046145
[2021-05-17 07:18:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin219506398762046145
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin219506398762046145]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin219506398762046145] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin219506398762046145] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-10-12 finished in 35769 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Applied a total of 2 rules in 51 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 07:18:48] [INFO ] Computed 340 place invariants in 18 ms
[2021-05-17 07:18:48] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 07:18:48] [INFO ] Computed 340 place invariants in 15 ms
[2021-05-17 07:18:49] [INFO ] Implicit Places using invariants and state equation in 783 ms returned [419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1275 ms to find 11 implicit places.
[2021-05-17 07:18:49] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 07:18:49] [INFO ] Computed 330 place invariants in 17 ms
[2021-05-17 07:18:49] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Starting structural reductions, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2021-05-17 07:18:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 07:18:49] [INFO ] Computed 330 place invariants in 32 ms
[2021-05-17 07:18:49] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Finished structural reductions, in 2 iterations. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-10-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6768 reset in 130 ms.
Product exploration explored 100000 steps with 6776 reset in 148 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA QuasiCertifProtocol-PT-10-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-10-13 finished in 2399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(F(p0))&&(F(G(p1))||(p2 U (p3||G(p2)))))||G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:50] [INFO ] Computed 340 place invariants in 34 ms
[2021-05-17 07:18:50] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:50] [INFO ] Computed 340 place invariants in 37 ms
[2021-05-17 07:18:51] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:51] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 07:18:51] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) p3 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (LT s0 1) (LT s63 1)) (OR (LT s0 1) (LT s10 1))), p2:(OR (LT s0 1) (LT s63 1)), p0:(GEQ s17 1), p1:(OR (LT s0 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-14 finished in 1382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:51] [INFO ] Computed 340 place invariants in 15 ms
[2021-05-17 07:18:52] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:52] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 07:18:52] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 07:18:52] [INFO ] Computed 340 place invariants in 20 ms
[2021-05-17 07:18:53] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s87 1), p1:(OR (LT s0 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6916 reset in 165 ms.
Product exploration explored 100000 steps with 6917 reset in 134 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), p1]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 6925 reset in 124 ms.
Product exploration explored 100000 steps with 6929 reset in 187 ms.
Applying partial POR strategy [false, false, false, true, true, false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 27 ms. Remains 513 /513 variables (removed 0) and now considering 178/176 (removed -2) transitions.
[2021-05-17 07:18:54] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 178 rows 513 cols
[2021-05-17 07:18:54] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 07:18:54] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 178/176 transitions.
Product exploration explored 100000 steps with 6923 reset in 413 ms.
Product exploration explored 100000 steps with 6928 reset in 455 ms.
[2021-05-17 07:18:55] [INFO ] Flatten gal took : 19 ms
[2021-05-17 07:18:55] [INFO ] Flatten gal took : 15 ms
[2021-05-17 07:18:55] [INFO ] Time to serialize gal into /tmp/LTL7982728435362505927.gal : 2 ms
[2021-05-17 07:18:55] [INFO ] Time to serialize properties into /tmp/LTL651170491220768460.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7982728435362505927.gal, -t, CGAL, -LTL, /tmp/LTL651170491220768460.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7982728435362505927.gal -t CGAL -LTL /tmp/LTL651170491220768460.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(a1>=1)")U(X(X(G("((malicious_reservoir<1)||(s4_2<1))")))))))
Formula 0 simplified : !X("(a1>=1)" U XXG"((malicious_reservoir<1)||(s4_2<1))")
Detected timeout of ITS tools.
[2021-05-17 07:19:10] [INFO ] Flatten gal took : 27 ms
[2021-05-17 07:19:10] [INFO ] Applying decomposition
[2021-05-17 07:19:10] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3018900321057636704.txt, -o, /tmp/graph3018900321057636704.bin, -w, /tmp/graph3018900321057636704.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3018900321057636704.bin, -l, -1, -v, -w, /tmp/graph3018900321057636704.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:19:10] [INFO ] Decomposing Gal with order
[2021-05-17 07:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:19:11] [INFO ] Removed a total of 109 redundant transitions.
[2021-05-17 07:19:11] [INFO ] Flatten gal took : 32 ms
[2021-05-17 07:19:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 13 ms.
[2021-05-17 07:19:11] [INFO ] Time to serialize gal into /tmp/LTL7820253660091165907.gal : 4 ms
[2021-05-17 07:19:11] [INFO ] Time to serialize properties into /tmp/LTL11010471376365834764.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7820253660091165907.gal, -t, CGAL, -LTL, /tmp/LTL11010471376365834764.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7820253660091165907.gal -t CGAL -LTL /tmp/LTL11010471376365834764.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i12.i1.u33.a1>=1)")U(X(X(G("((u0.malicious_reservoir<1)||(i14.i0.u13.s4_2<1))")))))))
Formula 0 simplified : !X("(i12.i1.u33.a1>=1)" U XXG"((u0.malicious_reservoir<1)||(i14.i0.u13.s4_2<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4894977200705037868
[2021-05-17 07:19:26] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4894977200705037868
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4894977200705037868]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4894977200705037868] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4894977200705037868] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-10-15 finished in 35355 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10753775106336665557
[2021-05-17 07:19:27] [INFO ] Applying decomposition
[2021-05-17 07:19:27] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2021-05-17 07:19:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:27] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2021-05-17 07:19:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:27] [INFO ] Flatten gal took : 38 ms
[2021-05-17 07:19:27] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2021-05-17 07:19:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:27] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10753775106336665557
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10753775106336665557]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16744155222184100032.txt, -o, /tmp/graph16744155222184100032.bin, -w, /tmp/graph16744155222184100032.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16744155222184100032.bin, -l, -1, -v, -w, /tmp/graph16744155222184100032.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:19:27] [INFO ] Decomposing Gal with order
[2021-05-17 07:19:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:19:27] [INFO ] Removed a total of 108 redundant transitions.
[2021-05-17 07:19:27] [INFO ] Flatten gal took : 67 ms
[2021-05-17 07:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 9 ms.
[2021-05-17 07:19:27] [INFO ] Time to serialize gal into /tmp/LTLFireability962267432613790035.gal : 4 ms
[2021-05-17 07:19:27] [INFO ] Time to serialize properties into /tmp/LTLFireability18310613260711925087.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability962267432613790035.gal, -t, CGAL, -LTL, /tmp/LTLFireability18310613260711925087.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability962267432613790035.gal -t CGAL -LTL /tmp/LTLFireability18310613260711925087.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(G(!("((((((((((((i18.i0.u56.s3_8>=1)&&(i18.i0.u56.n5_8>=1))||((i15.i1.u65.s3_1>=1)&&(i15.i1.u65.n5_1>=1)))||((i11.i0.u19.s3_9>=1)&&(i11.i0.u19.n5_9>=1)))||((i12.u66.s3_7>=1)&&(i12.u66.n5_7>=1)))||((i21.i1.u63.s3_0>=1)&&(i21.i1.u63.n5_0>=1)))||((i9.i0.u61.s3_6>=1)&&(i9.i0.u61.n5_6>=1)))||((i17.i1.u62.s3_5>=1)&&(i17.i1.u62.n5_5>=1)))||((i13.i0.u60.s3_4>=1)&&(i13.i0.u60.n5_4>=1)))||((i20.i1.u58.s3_3>=1)&&(i20.i1.u58.n5_3>=1)))||((i16.u67.s3_10>=1)&&(i16.u67.n5_10>=1)))||((i14.u64.s3_2>=1)&&(i14.u64.n5_2>=1)))"))))))
Formula 0 simplified : !XXG!"((((((((((((i18.i0.u56.s3_8>=1)&&(i18.i0.u56.n5_8>=1))||((i15.i1.u65.s3_1>=1)&&(i15.i1.u65.n5_1>=1)))||((i11.i0.u19.s3_9>=1)&&(i11.i0.u19.n5_9>=1)))||((i12.u66.s3_7>=1)&&(i12.u66.n5_7>=1)))||((i21.i1.u63.s3_0>=1)&&(i21.i1.u63.n5_0>=1)))||((i9.i0.u61.s3_6>=1)&&(i9.i0.u61.n5_6>=1)))||((i17.i1.u62.s3_5>=1)&&(i17.i1.u62.n5_5>=1)))||((i13.i0.u60.s3_4>=1)&&(i13.i0.u60.n5_4>=1)))||((i20.i1.u58.s3_3>=1)&&(i20.i1.u58.n5_3>=1)))||((i16.u67.s3_10>=1)&&(i16.u67.n5_10>=1)))||((i14.u64.s3_2>=1)&&(i14.u64.n5_2>=1)))"
Compilation finished in 1906 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10753775106336665557]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
LTSmin run took 75320 ms.
FORMULA QuasiCertifProtocol-PT-10-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
WARNING : LTSmin timed out (>225 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
WARNING : LTSmin timed out (>225 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp5==true) U X(X([]((LTLAPp6==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
LTSmin run took 182761 ms.
FORMULA QuasiCertifProtocol-PT-10-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 1800 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
Detected timeout of ITS tools.
[2021-05-17 07:40:25] [INFO ] Flatten gal took : 24 ms
[2021-05-17 07:40:25] [INFO ] Time to serialize gal into /tmp/LTLFireability3777488613120848711.gal : 1 ms
[2021-05-17 07:40:25] [INFO ] Time to serialize properties into /tmp/LTLFireability4536081965081097203.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3777488613120848711.gal, -t, CGAL, -LTL, /tmp/LTLFireability4536081965081097203.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3777488613120848711.gal -t CGAL -LTL /tmp/LTLFireability4536081965081097203.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((F("(a2<1)"))&&(G(F("(Astart<1)")))))
Formula 0 simplified : !(F"(a2<1)" & GF"(Astart<1)")
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
Detected timeout of ITS tools.
[2021-05-17 08:01:22] [INFO ] Flatten gal took : 55 ms
[2021-05-17 08:01:23] [INFO ] Input system was already deterministic with 176 transitions.
[2021-05-17 08:01:23] [INFO ] Transformed 513 places.
[2021-05-17 08:01:23] [INFO ] Transformed 176 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 08:01:23] [INFO ] Time to serialize gal into /tmp/LTLFireability16753995359418658025.gal : 2 ms
[2021-05-17 08:01:23] [INFO ] Time to serialize properties into /tmp/LTLFireability3233091100101680397.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16753995359418658025.gal, -t, CGAL, -LTL, /tmp/LTLFireability3233091100101680397.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16753995359418658025.gal -t CGAL -LTL /tmp/LTLFireability3233091100101680397.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(a2<1)"))&&(G(F("(Astart<1)")))))
Formula 0 simplified : !(F"(a2<1)" & GF"(Astart<1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.028: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.054: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.053: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.067: LTL layer: formula: X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))))))))
pins2lts-mc-linux64( 1/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.094: "X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.095: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.156: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.811: DFS-FIFO for weak LTL, using special progress label 184
pins2lts-mc-linux64( 0/ 8), 0.811: There are 185 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.811: State length is 514, there are 187 groups
pins2lts-mc-linux64( 0/ 8), 0.811: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.811: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.811: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.811: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.759: ~1 levels ~960 states ~9528 transitions
pins2lts-mc-linux64( 1/ 8), 1.788: ~1 levels ~1920 states ~23392 transitions
pins2lts-mc-linux64( 7/ 8), 1.809: ~1 levels ~3840 states ~74328 transitions
pins2lts-mc-linux64( 1/ 8), 1.918: ~1 levels ~7680 states ~109624 transitions
pins2lts-mc-linux64( 6/ 8), 2.052: ~1 levels ~15360 states ~209136 transitions
pins2lts-mc-linux64( 6/ 8), 2.343: ~1 levels ~30720 states ~421536 transitions
pins2lts-mc-linux64( 6/ 8), 2.924: ~1 levels ~61440 states ~829368 transitions
pins2lts-mc-linux64( 7/ 8), 4.401: ~1 levels ~122880 states ~2130384 transitions
pins2lts-mc-linux64( 2/ 8), 7.082: ~1 levels ~245760 states ~3006696 transitions
pins2lts-mc-linux64( 0/ 8), 11.720: ~1 levels ~491520 states ~4999760 transitions
pins2lts-mc-linux64( 0/ 8), 19.368: ~1 levels ~983040 states ~8432344 transitions
pins2lts-mc-linux64( 0/ 8), 31.307: ~1 levels ~1966080 states ~13280808 transitions
pins2lts-mc-linux64( 6/ 8), 52.399: ~1 levels ~3932160 states ~27070888 transitions
pins2lts-mc-linux64( 1/ 8), 108.144: ~1 levels ~7864320 states ~55351808 transitions
pins2lts-mc-linux64( 1/ 8), 213.167: ~1 levels ~15728640 states ~107725216 transitions
pins2lts-mc-linux64( 1/ 8), 466.721: ~1 levels ~31457280 states ~233219640 transitions
pins2lts-mc-linux64( 2/ 8), 703.306: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 703.467:
pins2lts-mc-linux64( 0/ 8), 703.467: mean standard work distribution: 16.5% (states) 4.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 703.467:
pins2lts-mc-linux64( 0/ 8), 703.467: Explored 37043961 states 350738217 transitions, fanout: 9.468
pins2lts-mc-linux64( 0/ 8), 703.467: Total exploration time 702.590 sec (702.470 sec minimum, 702.516 sec on average)
pins2lts-mc-linux64( 0/ 8), 703.467: States per second: 52725, Transitions per second: 499208
pins2lts-mc-linux64( 0/ 8), 703.467:
pins2lts-mc-linux64( 0/ 8), 703.467: Progress states detected: 50202999
pins2lts-mc-linux64( 0/ 8), 703.467: Redundant explorations: -26.2121
pins2lts-mc-linux64( 0/ 8), 703.467:
pins2lts-mc-linux64( 0/ 8), 703.467: Queue width: 8B, total height: 24009607, memory: 183.18MB
pins2lts-mc-linux64( 0/ 8), 703.467: Tree memory: 639.0MB, 13.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 703.467: Tree fill ratio (roots/leafs): 37.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 703.467: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 703.467: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 703.467: Est. total memory use: 822.2MB (~1207.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((!(LTLAPp1==true)||((LTLAPp3==true)&&X(((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10753775106336665557]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-10, 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 r178-tajo-162089415200085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 ;