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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K 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 3.3K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 34K 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-COL-02-00
FORMULA_NAME QuasiCertifProtocol-COL-02-01
FORMULA_NAME QuasiCertifProtocol-COL-02-02
FORMULA_NAME QuasiCertifProtocol-COL-02-03
FORMULA_NAME QuasiCertifProtocol-COL-02-04
FORMULA_NAME QuasiCertifProtocol-COL-02-05
FORMULA_NAME QuasiCertifProtocol-COL-02-06
FORMULA_NAME QuasiCertifProtocol-COL-02-07
FORMULA_NAME QuasiCertifProtocol-COL-02-08
FORMULA_NAME QuasiCertifProtocol-COL-02-09
FORMULA_NAME QuasiCertifProtocol-COL-02-10
FORMULA_NAME QuasiCertifProtocol-COL-02-11
FORMULA_NAME QuasiCertifProtocol-COL-02-12
FORMULA_NAME QuasiCertifProtocol-COL-02-13
FORMULA_NAME QuasiCertifProtocol-COL-02-14
FORMULA_NAME QuasiCertifProtocol-COL-02-15

=== Now, execution of the tool begins

BK_START 1621232117484

Running Version 0
[2021-05-17 06:15:19] [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:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:15:19] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 06:15:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:15:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 592 ms
[2021-05-17 06:15:20] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:15:20] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 3 ms.
[2021-05-17 06:15:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_15439566507926802979.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 06:15:20] [INFO ] Flatten gal took : 19 ms
[2021-05-17 06:15:20] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:15:20] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 3 ms.
[2021-05-17 06:15:20] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2929614578169447350.dot
[2021-05-17 06:15:20] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-COL-02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 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 8 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:15:20] [INFO ] Computed 22 place invariants in 18 ms
[2021-05-17 06:15:20] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:20] [INFO ] Computed 22 place invariants in 7 ms
[2021-05-17 06:15:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 269 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:20] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-17 06:15:20] [INFO ] Dead Transitions using invariants and state equation in 76 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:15:20] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:15:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/86 places, 56/56 transitions.
[2021-05-17 06:15:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 14 ms
FORMULA QuasiCertifProtocol-COL-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 7 ms
[2021-05-17 06:15:21] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 100000 steps, including 16408 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 25) seen :9
Running SMT prover for 16 properties.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:21] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:15:21] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 06:15:21] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:15:21] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:15:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:21] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 06:15:21] [INFO ] Added : 23 causal constraints over 5 iterations in 46 ms. Result :sat
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:21] [INFO ] Added : 22 causal constraints over 5 iterations in 41 ms. Result :sat
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:15:21] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:21] [INFO ] Added : 21 causal constraints over 5 iterations in 42 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:22] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 9 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:15:22] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:22] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:22] [INFO ] Added : 25 causal constraints over 5 iterations in 37 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 06:15:22] [INFO ] Added : 26 causal constraints over 6 iterations in 37 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:22] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:15:22] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:22] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-17 06:15:22] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-15 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 1 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:15:22] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:15:22] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 377 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-COL-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 s70 1), p4:(GEQ s71 1), p0:(OR (GEQ s59 1) (GEQ s58 1) (GEQ s60 1)), p2:(AND (LT s59 1) (LT s58 1) (LT s60 1)), p3:(AND (OR (LT s32 1) (LT s56 1)) (OR (LT s33 1) (LT s57 1)) (OR (LT s31 1) (LT s55 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 111 steps with 24 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-00 finished in 614 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 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:15:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s70 1), p1:(AND (LT s65 1) (LT s64 1) (LT s66 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 16419 reset in 198 ms.
Product exploration explored 100000 steps with 16438 reset in 126 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-COL-02-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-02-01 finished in 595 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U (X(G(p0))||(X(p0)&&G(p1)))) 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:15:23] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 06:15:23] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:24] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Stuttering acceptance computed with spot in 189 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-COL-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 s68 1), p1:(AND (OR (LT s0 1) (LT s64 1)) (OR (LT s0 1) (LT s65 1)) (OR (LT s0 1) (LT s66 1))), p0:(AND (OR (AND (GEQ s0 1) (GEQ s64 1)) (AND (GEQ s0 1) (GEQ s65 1)) (AND (GEQ s0 1) (GEQ s66 1))) (OR (LT s40 1) (LT s41 1) (LT s42 1) (LT s71 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 11 steps with 2 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-02 finished in 328 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 12 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:15:24] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:24] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:15:24] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:15:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [43, 44, 45]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 92 ms to find 3 implicit places.
[2021-05-17 06:15:24] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:24] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 06:15:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 68/73 places, 54/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2021-05-17 06:15:24] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:24] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-17 06:15:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/73 places, 54/56 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s46 1)) (OR (LT s0 1) (LT s47 1)) (OR (LT s0 1) (LT s48 1))), p1:(AND (OR (LT s0 1) (LT s61 1)) (OR (LT s0 1) (LT s62 1)) (OR (LT s0 1) (LT s63 1))), p0:(LT s64 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 33925 reset in 244 ms.
Product exploration explored 100000 steps with 33933 reset in 164 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 47 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 3 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:15:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:25] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:25] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2021-05-17 06:15:25] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:25] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 06:15:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 54/54 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 33884 reset in 113 ms.
Product exploration explored 100000 steps with 33959 reset in 147 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:15:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:25] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:25] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2021-05-17 06:15:25] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 54 rows 68 cols
[2021-05-17 06:15:25] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:25] [INFO ] Dead Transitions using invariants and state equation in 27 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 1621232126497

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

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

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