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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 55K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621233791763

Running Version 0
[2021-05-17 06:43:13] [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:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:43:13] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-17 06:43:13] [INFO ] Transformed 86 places.
[2021-05-17 06:43:13] [INFO ] Transformed 56 transitions.
[2021-05-17 06:43:13] [INFO ] Parsed PT model containing 86 places and 56 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:43:13] [INFO ] Initial state test concluded for 5 properties.
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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 8 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:43:13] [INFO ] Computed 29 place invariants in 11 ms
[2021-05-17 06:43:13] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:43:13] [INFO ] Computed 29 place invariants in 4 ms
[2021-05-17 06:43:14] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:43:14] [INFO ] Computed 29 place invariants in 10 ms
[2021-05-17 06:43:14] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/86 places, 56/56 transitions.
[2021-05-17 06:43:14] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 06:43:14] [INFO ] Flatten gal took : 32 ms
FORMULA QuasiCertifProtocol-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:43:14] [INFO ] Flatten gal took : 10 ms
[2021-05-17 06:43:14] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 100000 steps, including 16427 resets, run finished after 232 ms. (steps per millisecond=431 ) properties (out of 19) seen :7
Running SMT prover for 12 properties.
// Phase 1: matrix 56 rows 84 cols
[2021-05-17 06:43:14] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 06:43:14] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:43:14] [INFO ] Added : 24 causal constraints over 5 iterations in 58 ms. Result :sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:43:14] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:43:14] [INFO ] Added : 25 causal constraints over 5 iterations in 37 ms. Result :sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:14] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:14] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:43:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:14] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:15] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 06:43:15] [INFO ] Added : 18 causal constraints over 4 iterations in 43 ms. Result :sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:15] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:15] [INFO ] Added : 29 causal constraints over 6 iterations in 34 ms. Result :sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 2 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 06:43:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:43:15] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:15] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 2 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using 1 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:43:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using 1 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-17 06:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:43:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:43:15] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 06:43:15] [INFO ] Added : 25 causal constraints over 5 iterations in 32 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
[2021-05-17 06:43:15] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 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:43:15] [INFO ] Computed 25 place invariants in 8 ms
[2021-05-17 06:43:15] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:43:15] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 06:43:15] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 133 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:15] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 06:43:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 76/84 places, 56/56 transitions.
Applied a total of 0 rules in 2 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:43:15] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s68 s69 s70))], 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 6 ms.
FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-00 finished in 440 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.3 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 13 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:43:15] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:15] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 53 rows 73 cols
[2021-05-17 06:43:15] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 06:43:16] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [41, 42, 48, 53, 59, 60]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 95 ms to find 6 implicit places.
[2021-05-17 06:43:16] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:43:16] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 06:43:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 67/84 places, 53/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2021-05-17 06:43:16] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:43:16] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:43:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 67/84 places, 53/56 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s1 s2 s3) (ADD s43 s44 s45 s46 s47 s48 s49 s53 s54))], 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 18729 reset in 296 ms.
Product exploration explored 100000 steps with 18758 reset in 219 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 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18783 reset in 95 ms.
Product exploration explored 100000 steps with 18738 reset in 109 ms.
[2021-05-17 06:43:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:43:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:43:17] [INFO ] Time to serialize gal into /tmp/LTL2894435864183996042.gal : 3 ms
[2021-05-17 06:43:17] [INFO ] Time to serialize properties into /tmp/LTL18284010099891594338.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/LTL2894435864183996042.gal, -t, CGAL, -LTL, /tmp/LTL18284010099891594338.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/LTL2894435864183996042.gal -t CGAL -LTL /tmp/LTL18284010099891594338.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((c1_0+c1_1)+c1_2)<=((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_0_2)+n8_2_1)+n8_1_1)+n8_0_1)+n8_1_2)+n8_2_2))"))))
Formula 0 simplified : !GF"(((c1_0+c1_1)+c1_2)<=((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_0_2)+n8_2_1)+n8_1_1)+n8_0_1)+n8_1_2)+n8_2_2))"
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t42, t43, t44, t45, t6.t46, t4.t47, 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
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.375584,29380,1,0,208,62716,136,149,2250,61913,367
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property QuasiCertifProtocol-PT-02-02 finished in 1715 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 5 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:43:17] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 06:43:17] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:17] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 06:43:17] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 148 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:17] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 73/84 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s7 s8 s9) (ADD s45 s46 s47 s48 s49 s50 s51 s56 s57))], 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 16434 reset in 146 ms.
Product exploration explored 100000 steps with 16428 reset in 108 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 81 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16421 reset in 110 ms.
Product exploration explored 100000 steps with 16440 reset in 109 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 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 7 ms. Remains 73 /73 variables (removed 0) and now considering 58/56 (removed -2) transitions.
[2021-05-17 06:43:18] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 58 rows 73 cols
[2021-05-17 06:43:18] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 58/56 transitions.
Entered a terminal (fully accepting) state of product in 77177 steps with 12684 reset in 310 ms.
FORMULA QuasiCertifProtocol-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-05 finished in 1653 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 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:43:19] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 56 rows 79 cols
[2021-05-17 06:43:19] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [46, 47, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 133 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:19] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 76/84 places, 56/56 transitions.
Applied a total of 0 rules in 2 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:43:19] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 196 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-PT-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 s1 s2 s3) (ADD s55 s61 s62)), p1:(LEQ 2 (ADD s34 s35 s40))], 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-PT-02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-06 finished in 419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U 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 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 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 1 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 10 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:43:19] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 53 rows 73 cols
[2021-05-17 06:43:19] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:19] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [41, 42, 48, 53, 59, 60]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 121 ms to find 6 implicit places.
[2021-05-17 06:43:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:43:19] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 40 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:43:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 53 rows 67 cols
[2021-05-17 06:43:19] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 67/84 places, 53/56 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s20), p0:(LEQ 1 s62)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18770 reset in 84 ms.
Product exploration explored 100000 steps with 18731 reset in 176 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 (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-PT-02-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-02-08 finished in 723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 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 5 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:43:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:20] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 56 rows 77 cols
[2021-05-17 06:43:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 06:43:20] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [44, 45, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 142 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 74 cols
[2021-05-17 06:43:20] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-17 06:43:20] [INFO ] Dead Transitions using invariants and state equation in 43 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:43:20] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:20] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s44 s21), p1:(GT s24 s58)], 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]]
Product exploration explored 100000 steps with 19006 reset in 155 ms.
Product exploration explored 100000 steps with 19023 reset in 169 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 74 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)))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 18958 reset in 143 ms.
Product exploration explored 100000 steps with 18970 reset in 134 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2021-05-17 06:43:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 74 cols
[2021-05-17 06:43:21] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 56/56 transitions.
Product exploration explored 100000 steps with 18994 reset in 231 ms.
Product exploration explored 100000 steps with 19037 reset in 234 ms.
[2021-05-17 06:43:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:43:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:43:22] [INFO ] Time to serialize gal into /tmp/LTL8976310663632462740.gal : 2 ms
[2021-05-17 06:43:22] [INFO ] Time to serialize properties into /tmp/LTL6685770706478777384.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/LTL8976310663632462740.gal, -t, CGAL, -LTL, /tmp/LTL6685770706478777384.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/LTL8976310663632462740.gal -t CGAL -LTL /tmp/LTL6685770706478777384.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(n7_2_2<=a5)")&&(F("(AstopAbort>n8_2_2)"))))))
Formula 0 simplified : !XG("(n7_2_2<=a5)" & F"(AstopAbort>n8_2_2)")
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t42, t43, t44, t45, t46, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/26/30/56
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
43 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.442489,32260,1,0,345,76089,147,262,2153,88298,581
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-02-10 finished in 2594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(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.
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
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 3 place count 75 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 75 transition count 54
Applied a total of 4 rules in 8 ms. Remains 75 /84 variables (removed 9) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 75 cols
[2021-05-17 06:43:23] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 54 rows 75 cols
[2021-05-17 06:43:23] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [43, 44, 50, 55, 61, 62]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 126 ms to find 6 implicit places.
[2021-05-17 06:43:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 69 cols
[2021-05-17 06:43:23] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 69/84 places, 54/56 transitions.
Applied a total of 0 rules in 15 ms. Remains 69 /69 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2021-05-17 06:43:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 69 cols
[2021-05-17 06:43:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/84 places, 54/56 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-11 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:(AND (GT s57 s24) (GT 1 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-11 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], 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 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 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 3 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:43:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 54 rows 74 cols
[2021-05-17 06:43:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [41, 42, 48]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 132 ms to find 3 implicit places.
[2021-05-17 06:43:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:43:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 71/84 places, 54/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2021-05-17 06:43:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 54 rows 71 cols
[2021-05-17 06:43:23] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 71/84 places, 54/56 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s58 s70)], 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 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-12 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], 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.
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 3 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:43:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2021-05-17 06:43:23] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 113 ms to find 3 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2021-05-17 06:43:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 33 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:43:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-17 06:43:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 73/84 places, 56/56 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-02-13 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 s0 s65)], 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 9 steps with 4 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-13 finished in 254 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621233804370

--------------------
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-PT-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-PT-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-162089415200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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