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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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 4.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 55K 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-02-00
FORMULA_NAME QuasiCertifProtocol-PT-02-01
FORMULA_NAME QuasiCertifProtocol-PT-02-02
FORMULA_NAME QuasiCertifProtocol-PT-02-03
FORMULA_NAME QuasiCertifProtocol-PT-02-04
FORMULA_NAME QuasiCertifProtocol-PT-02-05
FORMULA_NAME QuasiCertifProtocol-PT-02-06
FORMULA_NAME QuasiCertifProtocol-PT-02-07
FORMULA_NAME QuasiCertifProtocol-PT-02-08
FORMULA_NAME QuasiCertifProtocol-PT-02-09
FORMULA_NAME QuasiCertifProtocol-PT-02-10
FORMULA_NAME QuasiCertifProtocol-PT-02-11
FORMULA_NAME QuasiCertifProtocol-PT-02-12
FORMULA_NAME QuasiCertifProtocol-PT-02-13
FORMULA_NAME QuasiCertifProtocol-PT-02-14
FORMULA_NAME QuasiCertifProtocol-PT-02-15

=== Now, execution of the tool begins

BK_START 1621233793410

Running Version 0
[2021-05-17 06:43:15] [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 06:43:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:43:15] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-17 06:43:15] [INFO ] Transformed 86 places.
[2021-05-17 06:43:15] [INFO ] Transformed 56 transitions.
[2021-05-17 06:43:15] [INFO ] Parsed PT model containing 86 places and 56 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:43:15] [INFO ] Initial state test concluded for 1 properties.
Support contains 46 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 14 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:15] [INFO ] Computed 22 place invariants in 27 ms
[2021-05-17 06:43:15] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:15] [INFO ] Computed 22 place invariants in 8 ms
[2021-05-17 06:43:15] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 250 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:15] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 73/86 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:15] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/86 places, 56/56 transitions.
[2021-05-17 06:43:15] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 06:43:15] [INFO ] Flatten gal took : 38 ms
FORMULA QuasiCertifProtocol-PT-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:43:15] [INFO ] Flatten gal took : 8 ms
[2021-05-17 06:43:15] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 100000 steps, including 16438 resets, run finished after 185 ms. (steps per millisecond=540 ) properties (out of 25) seen :10
Running SMT prover for 15 properties.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:16] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 11 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-17 06:43:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:43:16] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:16] [INFO ] Added : 17 causal constraints over 4 iterations in 39 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:16] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 06:43:16] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:16] [INFO ] Added : 23 causal constraints over 5 iterations in 39 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:16] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:16] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:16] [INFO ] Added : 18 causal constraints over 4 iterations in 26 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 06:43:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:43:16] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 9 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:16] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:17] [INFO ] Added : 26 causal constraints over 6 iterations in 34 ms. Result :sat
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-17 06:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:17] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:17] [INFO ] Added : 22 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 5 ms returned sat
[2021-05-17 06:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:17] [INFO ] Added : 22 causal constraints over 5 iterations in 43 ms. Result :sat
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-17 06:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:17] [INFO ] Added : 22 causal constraints over 5 iterations in 39 ms. Result :sat
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 15 ms returned sat
[2021-05-17 06:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:43:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 06:43:17] [INFO ] Added : 21 causal constraints over 5 iterations in 39 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-17 06:43:17] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||(X(G((X(p3)&&p2))) U G(p4)))))], workingDir=/home/mcc/execution]
Support contains 11 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:17] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:17] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:17] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:17] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 584 ms :[(AND (NOT p1) (NOT p4)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (NOT p4), true, (AND p2 (NOT p3)), (AND (NOT p4) p2), (AND (NOT p4) p2 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p4) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p4 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p4 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p4 p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p4) p2), acceptance={} source=2 dest: 5}, { cond=(AND p4 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p4 p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p4), acceptance={} source=3 dest: 1}, { cond=p4, acceptance={} source=3 dest: 2}, { cond=(NOT p4), acceptance={0} source=3 dest: 3}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p4) p2), acceptance={} source=6 dest: 4}, { cond=(AND p4 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p4) p2 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p4 p2 (NOT p3)), acceptance={} source=7 dest: 6}]], initial=0, aps=[p1:(GEQ s24 1), p4:(GEQ s28 1), p0:(OR (GEQ s10 1) (GEQ s11 1) (GEQ s12 1)), p2:(AND (LT s10 1) (LT s11 1) (LT s12 1)), p3:(AND (OR (LT s16 1) (LT s69 1)) (OR (LT s14 1) (LT s62 1)) (OR (LT s13 1) (LT s63 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 46 steps with 9 reset in 5 ms.
FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-00 finished in 877 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((!p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:18] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:18] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:18] [INFO ] Computed 20 place invariants in 6 ms
[2021-05-17 06:43:18] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:18] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s24 1), p1:(AND (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 16411 reset in 394 ms.
Product exploration explored 100000 steps with 16414 reset in 213 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA QuasiCertifProtocol-PT-02-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-02-01 finished in 1099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))) U p2))], workingDir=/home/mcc/execution]
Support contains 9 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:19] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:19] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s25 1), p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s5 1))), p0:(AND (OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s5 1))) (OR (LT s28 1) (LT s53 1) (LT s54 1) (LT s55 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-02 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (!p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 8 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 56/56 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 71 transition count 54
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 71 transition count 54
Applied a total of 3 rules in 17 ms. Remains 71 /73 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:43:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:43:20] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [51, 57, 58]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 111 ms to find 3 implicit places.
[2021-05-17 06:43:20] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:20] [INFO ] Computed 18 place invariants in 8 ms
[2021-05-17 06:43:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 68/73 places, 54/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2021-05-17 06:43:20] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:20] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-17 06:43:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/73 places, 54/56 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-03 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s22 1))), p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s5 1))), p0:(LT s21 1)], nbAcceptance=0, 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 33957 reset in 315 ms.
Product exploration explored 100000 steps with 33972 reset in 191 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 54
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 p2)), (F (G p1)), (F (G p0)), (NOT p2), p1, p0]
Adopting property with smaller alphabet thanks to knowledge :(F (G p0))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 68/68 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:21] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:43:21] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:21] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 06:43:21] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2021-05-17 06:43:21] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:21] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 06:43:21] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 54/54 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 33958 reset in 156 ms.
Product exploration explored 100000 steps with 33906 reset in 176 ms.
Starting structural reductions, iteration 0 : 68/68 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:21] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:43:21] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:21] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-17 06:43:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2021-05-17 06:43:22] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:43:22] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-17 06:43:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 54/54 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621233802910

--------------------
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-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;