Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400963.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400963
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 78K May 10 09:34 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-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652992957905

Running Version 202205111006
[2022-05-19 20:42:39] [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]
[2022-05-19 20:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:42:39] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-19 20:42:39] [INFO ] Transformed 270 places.
[2022-05-19 20:42:39] [INFO ] Transformed 116 transitions.
[2022-05-19 20:42:39] [INFO ] Parsed PT model containing 270 places and 116 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 263 transition count 116
Applied a total of 7 rules in 22 ms. Remains 263 /270 variables (removed 7) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 263 cols
[2022-05-19 20:42:39] [INFO ] Computed 148 place invariants in 23 ms
[2022-05-19 20:42:39] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 116 rows 263 cols
[2022-05-19 20:42:39] [INFO ] Computed 148 place invariants in 9 ms
[2022-05-19 20:42:40] [INFO ] Implicit Places using invariants and state equation in 437 ms returned [156, 157, 158, 159, 168, 169]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 746 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/270 places, 116/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 257 /257 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 257/270 places, 116/116 transitions.
Support contains 132 out of 257 places after structural reductions.
[2022-05-19 20:42:40] [INFO ] Flatten gal took : 46 ms
[2022-05-19 20:42:40] [INFO ] Flatten gal took : 17 ms
[2022-05-19 20:42:40] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 982 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 116 rows 257 cols
[2022-05-19 20:42:41] [INFO ] Computed 142 place invariants in 4 ms
[2022-05-19 20:42:41] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-19 20:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-19 20:42:41] [INFO ] [Nat]Absence check using 2 positive and 140 generalized place invariants in 21 ms returned sat
[2022-05-19 20:42:42] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2022-05-19 20:42:42] [INFO ] After 1120ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 379 ms.
[2022-05-19 20:42:43] [INFO ] After 1805ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 15 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 16 properties in 13 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 257 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 257 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||G(F(X(F(p1))))))))'
Support contains 51 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 246 transition count 116
Applied a total of 11 rules in 12 ms. Remains 246 /257 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:42:43] [INFO ] Computed 132 place invariants in 7 ms
[2022-05-19 20:42:43] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:42:43] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 20:42:43] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/257 places, 116/116 transitions.
Applied a total of 0 rules in 12 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s51 (ADD s54 s55 s56 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9829 reset in 407 ms.
Stuttering criterion allowed to conclude after 62668 steps with 6159 reset in 190 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 1303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(!(p1 U p1))))'
Support contains 14 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Graph (complete) has 801 edges and 257 vertex of which 245 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 242 transition count 111
Applied a total of 5 rules in 26 ms. Remains 242 /257 variables (removed 15) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 242 cols
[2022-05-19 20:42:44] [INFO ] Computed 133 place invariants in 2 ms
[2022-05-19 20:42:44] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 111 rows 242 cols
[2022-05-19 20:42:44] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 20:42:45] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [154, 195, 196, 220, 221, 222, 223, 224]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 374 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/257 places, 111/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 234/257 places, 111/116 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s21 s23 s24 s25 s26 s29 s30)), p0:(LEQ 2 (ADD s95 s96 s106 s107 s108 s109 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10257 reset in 197 ms.
Product exploration explored 100000 steps with 10252 reset in 189 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 480 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1027 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 81942 steps, run visited all 2 properties in 246 ms. (steps per millisecond=333 )
Probabilistic random walk after 81942 steps, saw 15088 distinct states, run finished after 246 ms. (steps per millisecond=333 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 604 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p0)), (NOT p0)]
Support contains 14 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 111/111 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 20:42:47] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 20:42:47] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 20:42:47] [INFO ] Computed 126 place invariants in 7 ms
[2022-05-19 20:42:47] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-05-19 20:42:47] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 20:42:47] [INFO ] Computed 126 place invariants in 5 ms
[2022-05-19 20:42:47] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 111/111 transitions.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1025 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Finished probabilistic random walk after 81942 steps, run visited all 2 properties in 196 ms. (steps per millisecond=418 )
Probabilistic random walk after 81942 steps, saw 15088 distinct states, run finished after 196 ms. (steps per millisecond=418 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 10256 reset in 136 ms.
Product exploration explored 100000 steps with 10252 reset in 139 ms.
Built C files in :
/tmp/ltsmin14240513786504236085
[2022-05-19 20:42:49] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2022-05-19 20:42:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:42:49] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2022-05-19 20:42:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:42:49] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2022-05-19 20:42:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:42:49] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14240513786504236085
Running compilation step : cd /tmp/ltsmin14240513786504236085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin14240513786504236085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14240513786504236085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1805399161478393966.hoa' '--buchi-type=spotba'
LTSmin run took 329 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 5552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!G(p0)) U !F(X(p1))))'
Support contains 58 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 248 transition count 116
Applied a total of 9 rules in 5 ms. Remains 248 /257 variables (removed 9) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 248 cols
[2022-05-19 20:42:50] [INFO ] Computed 134 place invariants in 2 ms
[2022-05-19 20:42:50] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 116 rows 248 cols
[2022-05-19 20:42:50] [INFO ] Computed 134 place invariants in 4 ms
[2022-05-19 20:42:50] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 377 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/257 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 247/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT s8 s15) (LEQ (ADD s23 s25 s26 s27 s28 s31 s32) s15)), p0:(LEQ 1 (ADD s56 s57 s58 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9834 reset in 135 ms.
Product exploration explored 100000 steps with 9832 reset in 130 ms.
Computed a total of 247 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 652 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 985 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 729073 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 729073 steps, saw 120096 distinct states, run finished after 3003 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:42:55] [INFO ] Computed 133 place invariants in 5 ms
[2022-05-19 20:42:55] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 20:42:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-19 20:42:55] [INFO ] [Nat]Absence check using 1 positive and 132 generalized place invariants in 22 ms returned sat
[2022-05-19 20:42:55] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 20:42:56] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-19 20:42:56] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 4 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 368 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 892 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Support contains 58 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:42:57] [INFO ] Computed 133 place invariants in 6 ms
[2022-05-19 20:42:57] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:42:57] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 20:42:58] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:42:58] [INFO ] Computed 133 place invariants in 8 ms
[2022-05-19 20:42:58] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 247/247 places, 116/116 transitions.
Computed a total of 247 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 683015 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683015 steps, saw 113235 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:43:02] [INFO ] Computed 133 place invariants in 7 ms
[2022-05-19 20:43:02] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 20:43:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-19 20:43:02] [INFO ] [Nat]Absence check using 1 positive and 132 generalized place invariants in 18 ms returned sat
[2022-05-19 20:43:02] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 20:43:02] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-19 20:43:02] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 48 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 4 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9838 reset in 119 ms.
Product exploration explored 100000 steps with 9831 reset in 132 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Support contains 58 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 116/116 transitions.
Graph (complete) has 728 edges and 247 vertex of which 239 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3 place count 239 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 20 ms. Remains 239 /247 variables (removed 8) and now considering 116/116 (removed 0) transitions.
[2022-05-19 20:43:04] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 116 rows 239 cols
[2022-05-19 20:43:04] [INFO ] Computed 127 place invariants in 7 ms
[2022-05-19 20:43:04] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/247 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/247 places, 116/116 transitions.
Product exploration explored 100000 steps with 9828 reset in 278 ms.
Product exploration explored 100000 steps with 9830 reset in 285 ms.
Built C files in :
/tmp/ltsmin6271289475751163234
[2022-05-19 20:43:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6271289475751163234
Running compilation step : cd /tmp/ltsmin6271289475751163234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin6271289475751163234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6271289475751163234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7162314291215664965.hoa' '--buchi-type=spotba'
LTSmin run took 2762 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-06 finished in 17619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!((p0 U p1) U X(!X(p0)))||p2))))'
Support contains 6 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 247 transition count 116
Applied a total of 10 rules in 5 ms. Remains 247 /257 variables (removed 10) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:43:08] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 20:43:08] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 20:43:08] [INFO ] Computed 133 place invariants in 4 ms
[2022-05-19 20:43:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/257 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 246/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 505 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=6 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=8 dest: 5}]], initial=0, aps=[p2:(LEQ s52 s2), p1:(LEQ s46 s42), p0:(LEQ s245 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9838 reset in 121 ms.
Product exploration explored 100000 steps with 9824 reset in 131 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 12 factoid took 589 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-08 finished in 2157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((false U X(p0))||G(!p0)))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 246 transition count 116
Applied a total of 11 rules in 7 ms. Remains 246 /257 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:43:10] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-19 20:43:10] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:43:10] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 20:43:10] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 371 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/257 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GT s177 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9834 reset in 108 ms.
Product exploration explored 100000 steps with 9836 reset in 117 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 984 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1251114 steps, run visited all 1 properties in 1706 ms. (steps per millisecond=733 )
Probabilistic random walk after 1251114 steps, saw 199447 distinct states, run finished after 1706 ms. (steps per millisecond=733 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 827 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 20:43:13] [INFO ] Computed 132 place invariants in 14 ms
[2022-05-19 20:43:14] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 20:43:14] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-19 20:43:14] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 20:43:14] [INFO ] Computed 132 place invariants in 7 ms
[2022-05-19 20:43:14] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1251114 steps, run visited all 1 properties in 1563 ms. (steps per millisecond=800 )
Probabilistic random walk after 1251114 steps, saw 199447 distinct states, run finished after 1563 ms. (steps per millisecond=800 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 101 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Product exploration explored 100000 steps with 9832 reset in 110 ms.
Product exploration explored 100000 steps with 9832 reset in 128 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0]
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 166 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 166 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 166 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 16 rules in 15 ms. Remains 166 /245 variables (removed 79) and now considering 86/116 (removed 30) transitions.
[2022-05-19 20:43:17] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 86 rows 166 cols
[2022-05-19 20:43:17] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-19 20:43:17] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/245 places, 86/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/245 places, 86/116 transitions.
Product exploration explored 100000 steps with 9572 reset in 189 ms.
Product exploration explored 100000 steps with 9589 reset in 199 ms.
Built C files in :
/tmp/ltsmin17614348333632322893
[2022-05-19 20:43:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17614348333632322893
Running compilation step : cd /tmp/ltsmin17614348333632322893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 964 ms.
Running link step : cd /tmp/ltsmin17614348333632322893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17614348333632322893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7318318180076800007.hoa' '--buchi-type=spotba'
LTSmin run took 1932 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-10 finished in 10563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(p1)||p2))))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 248 transition count 116
Applied a total of 9 rules in 5 ms. Remains 248 /257 variables (removed 9) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 248 cols
[2022-05-19 20:43:20] [INFO ] Computed 134 place invariants in 4 ms
[2022-05-19 20:43:20] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 116 rows 248 cols
[2022-05-19 20:43:20] [INFO ] Computed 134 place invariants in 4 ms
[2022-05-19 20:43:20] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/257 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 247/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 437 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (LEQ s0 s107) (LEQ s0 s108)), p0:(OR (GT 1 s42) (LEQ s0 s108)), p1:(LEQ s0 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-11 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(G(p0))))&&p1)))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 116/116 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 246 transition count 116
Applied a total of 11 rules in 4 ms. Remains 246 /257 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:43:21] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 20:43:21] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 116 rows 246 cols
[2022-05-19 20:43:21] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 20:43:21] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/257 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/257 places, 116/116 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GT s8 s207), p0:(GT s89 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-14 finished in 534 ms.
All properties solved by simple procedures.
Total runtime 42922 ms.

BK_STOP 1652993002412

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;