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-162089415100012.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415100012
=====================================================================

--------------------
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 1621232118196

Running Version 0
[2021-05-17 06:15:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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) : 627 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 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 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 4 ms.
[2021-05-17 06:15:20] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_17224036587578576472.dot
[2021-05-17 06:15:20] [INFO ] Initial state test concluded for 3 properties.
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 13277 resets, run finished after 158 ms. (steps per millisecond=632 ) properties (out of 25) seen :24
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 30 cols
[2021-05-17 06:15:21] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-17 06:15:21] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-17 06:15:21] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 28 ms
FORMULA QuasiCertifProtocol-COL-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 20 ms
[2021-05-17 06:15:21] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 2 ms.
[2021-05-17 06:15:21] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7868509861950131593.dot
Support contains 53 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 56
Applied a total of 2 rules in 35 ms. Remains 84 /86 variables (removed 2) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:15:21] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-17 06:15:21] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:15:21] [INFO ] Computed 29 place invariants in 3 ms
[2021-05-17 06:15:21] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:15:21] [INFO ] Computed 29 place invariants in 3 ms
[2021-05-17 06:15:21] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/86 places, 56/56 transitions.
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 9 ms
[2021-05-17 06:15:21] [INFO ] Flatten gal took : 8 ms
[2021-05-17 06:15:21] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 100000 steps, including 16431 resets, run finished after 188 ms. (steps per millisecond=531 ) properties (out of 16) seen :6
Running SMT prover for 10 properties.
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:15:22] [INFO ] Computed 29 place invariants in 5 ms
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 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 35 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 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 4 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 22 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 : 27 causal constraints over 6 iterations in 45 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 7 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 21 ms returned unsat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 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 21 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 1 positive place invariants in 8 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 6 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 22 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 06:15:22] [INFO ] Added : 22 causal constraints over 5 iterations in 51 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 5 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 21 ms returned sat
[2021-05-17 06:15:22] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 06:15:22] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 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 21 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 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 4 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 20 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 : 17 causal constraints over 4 iterations in 28 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 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 21 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 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 4 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 24 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 : 28 causal constraints over 6 iterations in 36 ms. Result :sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:22] [INFO ] [Real]Absence check using 1 positive and 28 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 21 ms returned sat
[2021-05-17 06:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-17 06:15:23] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:23] [INFO ] Added : 24 causal constraints over 5 iterations in 32 ms. Result :sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-17 06:15:23] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:23] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:15:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:15:23] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:15:23] [INFO ] Added : 27 causal constraints over 6 iterations in 35 ms. Result :sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:15:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 06:15:23] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:15:23] [INFO ] Added : 24 causal constraints over 5 iterations in 29 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 79 transition count 56
Applied a total of 5 rules in 2 ms. Remains 79 /84 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:15:23] [INFO ] Computed 25 place invariants in 6 ms
[2021-05-17 06:15:23] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:15:23] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 124 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 76/84 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:23] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s67 s68 s69))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 2 ms.
FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-00 finished in 608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Graph (complete) has 176 edges and 84 vertex of which 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 5 place count 73 transition count 53
Applied a total of 5 rules in 29 ms. Remains 73 /84 variables (removed 11) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 73 cols
[2021-05-17 06:15:24] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:24] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 53 rows 73 cols
[2021-05-17 06:15:24] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 06:15:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [43, 44, 45, 49, 50, 51]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 135 ms to find 6 implicit places.
[2021-05-17 06:15:24] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:15:24] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 06:15:24] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 67/84 places, 53/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-17 06:15:24] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:15:24] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:15:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 67/84 places, 53/56 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s43 s44 s45) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18738 reset in 256 ms.
Product exploration explored 100000 steps with 18775 reset in 186 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 53
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 (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18793 reset in 84 ms.
Product exploration explored 100000 steps with 18752 reset in 128 ms.
[2021-05-17 06:15:25] [INFO ] Flatten gal took : 5 ms
[2021-05-17 06:15:25] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:15:25] [INFO ] Time to serialize gal into /tmp/LTL17220240033418921487.gal : 1 ms
[2021-05-17 06:15:25] [INFO ] Time to serialize properties into /tmp/LTL15242220513032416157.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17220240033418921487.gal, -t, CGAL, -LTL, /tmp/LTL15242220513032416157.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17220240033418921487.gal -t CGAL -LTL /tmp/LTL15242220513032416157.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((c1_0+c1_1)+c1_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"))))
Formula 0 simplified : !GF"(((c1_0+c1_1)+c1_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t25, t26, t27, t28, t50, t52.t23, t54.t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/23/30/53
Computing Next relation with stutter on 47 deadlock states
30 unique states visited
30 strongly connected components in search stack
31 transitions explored
30 items max in DFS search stack
27 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.299723,29308,1,0,208,63976,136,149,2214,62389,367
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-02-02 finished in 1659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 76 transition count 56
Applied a total of 8 rules in 4 ms. Remains 76 /84 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:25] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 06:15:25] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:25] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:26] [INFO ] Implicit Places using invariants and state equation in 273 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 401 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:15:26] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 73/84 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:26] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:15:26] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-05 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:(LEQ (ADD s61 s62 s63) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18))], 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]]
Product exploration explored 100000 steps with 16442 reset in 137 ms.
Product exploration explored 100000 steps with 16418 reset in 123 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 (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16415 reset in 123 ms.
Product exploration explored 100000 steps with 16427 reset in 121 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 12 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 73/73 places, 56/56 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 58/56 (removed -2) transitions.
[2021-05-17 06:15:27] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 58 rows 73 cols
[2021-05-17 06:15:27] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:15:27] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 58/56 transitions.
Product exploration explored 100000 steps with 16445 reset in 295 ms.
Product exploration explored 100000 steps with 16434 reset in 237 ms.
[2021-05-17 06:15:28] [INFO ] Flatten gal took : 7 ms
[2021-05-17 06:15:28] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:15:28] [INFO ] Time to serialize gal into /tmp/LTL18293390621672103807.gal : 5 ms
[2021-05-17 06:15:28] [INFO ] Time to serialize properties into /tmp/LTL17777890410773155123.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18293390621672103807.gal, -t, CGAL, -LTL, /tmp/LTL17777890410773155123.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18293390621672103807.gal -t CGAL -LTL /tmp/LTL17777890410773155123.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(((s5_0+s5_1)+s5_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"))))
Formula 0 simplified : !XG"(((s5_0+s5_1)+s5_2)<=((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/26/30/56
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.380038,29244,1,0,226,64499,141,144,2259,62951,276
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-02-05 finished in 2772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&X(X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 79 transition count 56
Applied a total of 5 rules in 3 ms. Remains 79 /84 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:15:28] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 06:15:28] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:15:28] [INFO ] Computed 25 place invariants in 14 ms
[2021-05-17 06:15:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 170 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:28] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 76/84 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:28] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:15:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ (ADD s46 s47 s48) (ADD s43 s44 s45)), p1:(LEQ 2 (ADD s73 s74 s75))], 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 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-06 finished in 493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Graph (complete) has 176 edges and 84 vertex of which 77 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 76 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 76 transition count 55
Applied a total of 5 rules in 11 ms. Remains 76 /84 variables (removed 8) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 76 cols
[2021-05-17 06:15:28] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:15:29] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 55 rows 76 cols
[2021-05-17 06:15:29] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:29] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [50, 51, 52]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 151 ms to find 3 implicit places.
[2021-05-17 06:15:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 73 cols
[2021-05-17 06:15:29] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 06:15:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 73/84 places, 55/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2021-05-17 06:15:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 73 cols
[2021-05-17 06:15:29] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/84 places, 55/56 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s72), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18637 reset in 238 ms.
Product exploration explored 100000 steps with 18650 reset in 130 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 55
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 (OR (G p0) (G (NOT p0)))), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA QuasiCertifProtocol-COL-02-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-02-08 finished in 789 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 56
Applied a total of 7 rules in 2 ms. Remains 77 /84 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2021-05-17 06:15:29] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-17 06:15:29] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 56 rows 77 cols
[2021-05-17 06:15:29] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-17 06:15:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [50, 51, 52]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 109 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 74 cols
[2021-05-17 06:15:29] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 74/84 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2021-05-17 06:15:29] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 06:15:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s1 (ADD s50 s51 s52)), p1:(GT s69 (ADD s59 s60 s61))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-10 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Graph (complete) has 176 edges and 84 vertex of which 79 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 5 place count 76 transition count 53
Applied a total of 5 rules in 4 ms. Remains 76 /84 variables (removed 8) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 76 cols
[2021-05-17 06:15:30] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 53 rows 76 cols
[2021-05-17 06:15:30] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [43, 44, 45, 49, 50, 51]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 120 ms to find 6 implicit places.
[2021-05-17 06:15:30] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 53 rows 70 cols
[2021-05-17 06:15:30] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 70/84 places, 53/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-17 06:15:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 53 rows 70 cols
[2021-05-17 06:15:30] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 70/84 places, 53/56 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s64 s65 s66) (ADD s61 s62 s63)), p1:(LEQ 2 (ADD s61 s62 s63))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-11 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Graph (complete) has 176 edges and 84 vertex of which 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output 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 5 place count 74 transition count 54
Applied a total of 5 rules in 4 ms. Remains 74 /84 variables (removed 10) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 74 cols
[2021-05-17 06:15:30] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 54 rows 74 cols
[2021-05-17 06:15:30] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 115 ms to find 3 implicit places.
[2021-05-17 06:15:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:15:30] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 71/84 places, 54/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2021-05-17 06:15:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:15:30] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-17 06:15:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 71/84 places, 54/56 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s69 (ADD s34 s35 s36)), p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-12 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 76 transition count 56
Applied a total of 8 rules in 0 ms. Remains 76 /84 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:30] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:30] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:15:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:15:30] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 06:15:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s49 s50 s51)), p0:(LEQ 3 (ADD s34 s35 s36))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-13 finished in 206 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621232131322

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162089415100012"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;