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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K 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.4K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 13:08 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 61K 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-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15

=== Now, execution of the tool begins

BK_START 1621232118823

Running Version 0
[2021-05-17 06:15:21] [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:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:15:21] [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:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:15:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 589 ms
[2021-05-17 06:15:21] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:15:21] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 4 ms.
[2021-05-17 06:15:21] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_8516206189969483319.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:21] [INFO ] Flatten gal took : 18 ms
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 5 ms
[2021-05-17 06:15:21] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 7 ms.
[2021-05-17 06:15:21] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_14092059808137330849.dot
[2021-05-17 06:15:21] [INFO ] Initial state test concluded for 3 properties.
FORMULA QuasiCertifProtocol-COL-06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 42 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2021-05-17 06:15:22] [INFO ] Computed 138 place invariants in 47 ms
[2021-05-17 06:15:22] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2021-05-17 06:15:22] [INFO ] Computed 138 place invariants in 8 ms
[2021-05-17 06:15:22] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 906 ms to find 7 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:22] [INFO ] Computed 132 place invariants in 12 ms
[2021-05-17 06:15:23] [INFO ] Dead Transitions using invariants and state equation in 573 ms returned []
Starting structural reductions, iteration 1 : 245/270 places, 116/116 transitions.
Applied a total of 0 rules in 20 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:23] [INFO ] Computed 132 place invariants in 22 ms
[2021-05-17 06:15:23] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/270 places, 116/116 transitions.
[2021-05-17 06:15:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 06:15:23] [INFO ] Flatten gal took : 58 ms
FORMULA QuasiCertifProtocol-COL-06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:15:23] [INFO ] Flatten gal took : 40 ms
[2021-05-17 06:15:23] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 100000 steps, including 9831 resets, run finished after 959 ms. (steps per millisecond=104 ) properties (out of 15) seen :5
Running SMT prover for 10 properties.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:24] [INFO ] Computed 132 place invariants in 17 ms
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 22 ms returned sat
[2021-05-17 06:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-17 06:15:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:25] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 33 ms returned sat
[2021-05-17 06:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:25] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-17 06:15:25] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 06:15:25] [INFO ] Added : 45 causal constraints over 9 iterations in 149 ms. Result :sat
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 24 ms returned sat
[2021-05-17 06:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 35 ms returned sat
[2021-05-17 06:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:25] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-17 06:15:25] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-17 06:15:26] [INFO ] Added : 18 causal constraints over 4 iterations in 166 ms. Result :sat
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 19 ms returned sat
[2021-05-17 06:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 06:15:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 06:15:26] [INFO ] Added : 17 causal constraints over 4 iterations in 73 ms. Result :sat
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 29 ms returned sat
[2021-05-17 06:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 06:15:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 06:15:26] [INFO ] Added : 16 causal constraints over 4 iterations in 56 ms. Result :sat
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 30 ms returned sat
[2021-05-17 06:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-17 06:15:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 06:15:26] [INFO ] Added : 19 causal constraints over 4 iterations in 64 ms. Result :sat
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 19 ms returned sat
[2021-05-17 06:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:26] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 27 ms returned sat
[2021-05-17 06:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 06:15:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 06:15:27] [INFO ] Added : 42 causal constraints over 9 iterations in 140 ms. Result :sat
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 24 ms returned sat
[2021-05-17 06:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 181 ms returned sat
[2021-05-17 06:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:27] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-17 06:15:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 06:15:28] [INFO ] Added : 26 causal constraints over 6 iterations in 275 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2021-05-17 06:15:28] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 15 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 114
Applied a total of 4 rules in 46 ms. Remains 243 /245 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:28] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants in 2459 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:30] [INFO ] Computed 132 place invariants in 20 ms
[2021-05-17 06:15:31] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2021-05-17 06:15:31] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:31] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:15:31] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/245 places, 114/116 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s241 1) (OR (LT s186 1) (LT s200 1)) (OR (LT s184 1) (LT s198 1)) (OR (LT s188 1) (LT s202 1)) (OR (LT s183 1) (LT s197 1)) (OR (LT s185 1) (LT s199 1)) (OR (LT s187 1) (LT s201 1)) (OR (LT s189 1) (LT s203 1))), p0:(GEQ s241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-00 finished in 3416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:31] [INFO ] Computed 132 place invariants in 80 ms
[2021-05-17 06:15:31] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:31] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:15:32] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:32] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:15:32] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1)), p1:(AND (GEQ s243 1) (GEQ s176 1) (GEQ s177 1) (GEQ s178 1) (GEQ s179 1) (GEQ s180 1) (GEQ s181 1) (GEQ s182 1) (GEQ s243 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-01 finished in 940 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:32] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:32] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:32] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:32] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:32] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-02 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:(GEQ s240 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 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-02 finished in 678 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 14 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:33] [INFO ] Computed 132 place invariants in 10 ms
[2021-05-17 06:15:33] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:33] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:33] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:33] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:33] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-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:(OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ s185 1) (GEQ s199 1)) (AND (GEQ s187 1) (GEQ s201 1)) (AND (GEQ s189 1) (GEQ s203 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 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-04 finished in 865 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 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 243 transition count 114
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 243 transition count 114
Applied a total of 3 rules in 16 ms. Remains 243 /245 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:34] [INFO ] Computed 132 place invariants in 2 ms
[2021-05-17 06:15:34] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:34] [INFO ] Computed 132 place invariants in 6 ms
[2021-05-17 06:15:34] [INFO ] Implicit Places using invariants and state equation in 349 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 522 ms to find 7 implicit places.
[2021-05-17 06:15:34] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:15:34] [INFO ] Computed 126 place invariants in 7 ms
[2021-05-17 06:15:34] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 236/245 places, 114/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:15:34] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:15:34] [INFO ] Computed 126 place invariants in 19 ms
[2021-05-17 06:15:38] [INFO ] Dead Transitions using invariants and state equation in 3229 ms returned []
Finished structural reductions, in 2 iterations. Remains : 236/245 places, 114/116 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s169 1) (GEQ s197 1)) (AND (GEQ s172 1) (GEQ s200 1)) (AND (GEQ s173 1) (GEQ s201 1)) (AND (GEQ s170 1) (GEQ s198 1)) (AND (GEQ s171 1) (GEQ s199 1)) (AND (GEQ s174 1) (GEQ s202 1)) (AND (GEQ s175 1) (GEQ s203 1))), p0:(AND (GEQ s162 1) (GEQ s163 1) (GEQ s164 1) (GEQ s165 1) (GEQ s166 1) (GEQ s167 1) (GEQ s168 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-05 finished in 4086 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:38] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:15:38] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:38] [INFO ] Computed 132 place invariants in 17 ms
[2021-05-17 06:15:39] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:39] [INFO ] Computed 132 place invariants in 8 ms
[2021-05-17 06:15:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-06-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s211 1)) (AND (GEQ s0 1) (GEQ s212 1)) (AND (GEQ s0 1) (GEQ s213 1)) (AND (GEQ s0 1) (GEQ s214 1)) (AND (GEQ s0 1) (GEQ s215 1)) (AND (GEQ s0 1) (GEQ s216 1)) (AND (GEQ s0 1) (GEQ s217 1))), p1:(OR (AND (GEQ s155 1) (GEQ s211 1)) (AND (GEQ s159 1) (GEQ s215 1)) (AND (GEQ s156 1) (GEQ s212 1)) (AND (GEQ s158 1) (GEQ s214 1)) (AND (GEQ s160 1) (GEQ s216 1)) (AND (GEQ s157 1) (GEQ s213 1)) (AND (GEQ s161 1) (GEQ s217 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-06 finished in 1505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 9 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:39] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:40] [INFO ] Implicit Places using invariants in 1084 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:40] [INFO ] Computed 132 place invariants in 11 ms
[2021-05-17 06:15:40] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:40] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:15:41] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s190 1)) (OR (LT s0 1) (LT s191 1)) (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 1) (LT s195 1)) (OR (LT s0 1) (LT s196 1))), p0:(GEQ s240 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 p1)), (F (G (NOT p0))), p1, (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-06-08 finished in 2342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 14 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:41] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:42] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:42] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:42] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2021-05-17 06:15:42] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:15:42] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-06-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s169 1) (GEQ s204 1)) (AND (GEQ s172 1) (GEQ s207 1)) (AND (GEQ s173 1) (GEQ s208 1)) (AND (GEQ s170 1) (GEQ s205 1)) (AND (GEQ s171 1) (GEQ s206 1)) (AND (GEQ s174 1) (GEQ s209 1)) (AND (GEQ s175 1) (GEQ s210 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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-COL-06-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-06-09 finished in 1154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 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 244 transition count 115
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 244 transition count 115
Applied a total of 3 rules in 19 ms. Remains 244 /245 variables (removed 1) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:43] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:15:43] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:43] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:43] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2021-05-17 06:15:43] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:43] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:43] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/245 places, 115/116 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s148 1) (GEQ s149 1) (GEQ s150 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1) (GEQ s239 1)), p0:(OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ s185 1) (GEQ s199 1)) (AND (GEQ s187 1) (GEQ s201 1)) (AND (GEQ s189 1) (GEQ s203 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 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-11 finished in 730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 14 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 114
Applied a total of 4 rules in 14 ms. Remains 243 /245 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:43] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:15:44] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:44] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:44] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2021-05-17 06:15:44] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:44] [INFO ] Computed 132 place invariants in 3 ms
[2021-05-17 06:15:44] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/245 places, 114/116 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-06-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ s185 1) (GEQ s199 1)) (AND (GEQ s187 1) (GEQ s201 1)) (AND (GEQ s189 1) (GEQ s203 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-12 finished in 634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 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 244 transition count 115
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 244 transition count 115
Applied a total of 3 rules in 18 ms. Remains 244 /245 variables (removed 1) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:44] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:15:44] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:44] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:44] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2021-05-17 06:15:44] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 115 rows 244 cols
[2021-05-17 06:15:44] [INFO ] Computed 132 place invariants in 4 ms
[2021-05-17 06:15:45] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/245 places, 115/116 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s242 1), p1:(AND (GEQ s148 1) (GEQ s149 1) (GEQ s150 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1) (GEQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-14 finished in 720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 116/116 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 243 transition count 114
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 243 transition count 114
Applied a total of 3 rules in 14 ms. Remains 243 /245 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:45] [INFO ] Computed 132 place invariants in 5 ms
[2021-05-17 06:15:45] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 114 rows 243 cols
[2021-05-17 06:15:45] [INFO ] Computed 132 place invariants in 7 ms
[2021-05-17 06:15:45] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 429 ms to find 7 implicit places.
[2021-05-17 06:15:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:15:45] [INFO ] Computed 126 place invariants in 6 ms
[2021-05-17 06:15:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 236/245 places, 114/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-17 06:15:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 114 rows 236 cols
[2021-05-17 06:15:45] [INFO ] Computed 126 place invariants in 6 ms
[2021-05-17 06:15:45] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 236/245 places, 114/116 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s162 1) (GEQ s163 1) (GEQ s164 1) (GEQ s165 1) (GEQ s166 1) (GEQ s167 1) (GEQ s168 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-15 finished in 710 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621232146502

--------------------
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-06"
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-06, 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-162089415100021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 execution
cd execution
if [ "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 ;