Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 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-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678921942923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 23:12:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 23:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:12:24] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-15 23:12:24] [INFO ] Transformed 3806 places.
[2023-03-15 23:12:24] [INFO ] Transformed 506 transitions.
[2023-03-15 23:12:24] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3572 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 79 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:12:25] [INFO ] Computed 3232 place invariants in 118 ms
[2023-03-15 23:12:26] [INFO ] Implicit Places using invariants in 1545 ms returned []
[2023-03-15 23:12:26] [INFO ] Invariant cache hit.
[2023-03-15 23:12:28] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 3158 ms to find 0 implicit places.
[2023-03-15 23:12:28] [INFO ] Invariant cache hit.
[2023-03-15 23:12:29] [INFO ] Dead Transitions using invariants and state equation in 1433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4676 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3572 out of 3736 places after structural reductions.
[2023-03-15 23:12:30] [INFO ] Flatten gal took : 286 ms
[2023-03-15 23:12:30] [INFO ] Flatten gal took : 175 ms
[2023-03-15 23:12:30] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-15 23:12:31] [INFO ] Invariant cache hit.
[2023-03-15 23:12:34] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 741 ms returned sat
[2023-03-15 23:12:35] [INFO ] After 2685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-15 23:12:37] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 751 ms returned sat
[2023-03-15 23:12:55] [INFO ] After 16883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-15 23:13:00] [INFO ] After 21787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 23:13:00] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 236 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=33 )
Parikh walk visited 18 properties in 66 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(G(p2))||p1))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.40 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
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 3700 transition count 502
Applied a total of 4 rules in 728 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 23:13:01] [INFO ] Computed 3200 place invariants in 63 ms
[2023-03-15 23:13:05] [INFO ] Implicit Places using invariants in 4354 ms returned []
[2023-03-15 23:13:05] [INFO ] Invariant cache hit.
[2023-03-15 23:13:12] [INFO ] Implicit Places using invariants and state equation in 6687 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 11052 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 157 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11937 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s155 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s0 1) (GEQ s201 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 12226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3700 transition count 502
Applied a total of 3 rules in 570 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 23:13:13] [INFO ] Computed 3200 place invariants in 97 ms
[2023-03-15 23:13:19] [INFO ] Implicit Places using invariants in 5721 ms returned []
[2023-03-15 23:13:19] [INFO ] Invariant cache hit.
[2023-03-15 23:13:30] [INFO ] Implicit Places using invariants and state equation in 11067 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16799 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 277 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17647 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2462 reset in 727 ms.
Product exploration explored 100000 steps with 2464 reset in 629 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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 p1 p0 p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 286 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 20108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 121 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:13:33] [INFO ] Computed 3232 place invariants in 40 ms
[2023-03-15 23:13:35] [INFO ] Implicit Places using invariants in 2371 ms returned []
[2023-03-15 23:13:35] [INFO ] Invariant cache hit.
[2023-03-15 23:13:41] [INFO ] Implicit Places using invariants and state equation in 6406 ms returned []
Implicit Place search using SMT with State Equation took 8786 ms to find 0 implicit places.
[2023-03-15 23:13:41] [INFO ] Invariant cache hit.
[2023-03-15 23:13:42] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9580 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1438 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1446 1) (GEQ s1447 1) (GEQ s1448 1) (GEQ s1465 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 9774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 293 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-15 23:13:43] [INFO ] Computed 3200 place invariants in 35 ms
[2023-03-15 23:13:47] [INFO ] Implicit Places using invariants in 4580 ms returned []
[2023-03-15 23:13:47] [INFO ] Invariant cache hit.
[2023-03-15 23:13:53] [INFO ] Implicit Places using invariants and state equation in 6118 ms returned [3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10706 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3666/3736 places, 501/506 transitions.
Applied a total of 0 rules in 163 ms. Remains 3666 /3666 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11163 ms. Remains : 3666/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s1435 1) (GEQ s1438 1) (GEQ s1439 1) (GEQ s1440 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1462 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 11352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Support contains 67 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 245 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:13:54] [INFO ] Computed 3232 place invariants in 39 ms
[2023-03-15 23:14:00] [INFO ] Implicit Places using invariants in 5813 ms returned []
[2023-03-15 23:14:00] [INFO ] Invariant cache hit.
[2023-03-15 23:14:11] [INFO ] Implicit Places using invariants and state equation in 11414 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17237 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17729 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 111 ms :[p1, p1, true, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 17867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((p1&&X(p1))||p0))&&(X(G(p2))||F(p3))))'
Support contains 2245 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 44 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:14:11] [INFO ] Invariant cache hit.
[2023-03-15 23:14:14] [INFO ] Implicit Places using invariants in 2571 ms returned []
[2023-03-15 23:14:14] [INFO ] Invariant cache hit.
[2023-03-15 23:14:17] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 6039 ms to find 0 implicit places.
[2023-03-15 23:14:17] [INFO ] Invariant cache hit.
[2023-03-15 23:14:19] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7491 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s1438 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1446 1) (GEQ s1447 1) (GEQ s1448 1) (GEQ s1465 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 35 steps with 10 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-05 finished in 7742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:14:19] [INFO ] Invariant cache hit.
[2023-03-15 23:14:25] [INFO ] Implicit Places using invariants in 5694 ms returned []
[2023-03-15 23:14:25] [INFO ] Invariant cache hit.
[2023-03-15 23:14:38] [INFO ] Implicit Places using invariants and state equation in 12663 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18369 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18869 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2683 reset in 477 ms.
Product exploration explored 100000 steps with 2671 reset in 467 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 339 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1377895 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :{}
Probabilistic random walk after 1377895 steps, saw 165977 distinct states, run finished after 3005 ms. (steps per millisecond=458 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 23:14:44] [INFO ] Computed 3200 place invariants in 432 ms
[2023-03-15 23:14:45] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 742 ms returned sat
[2023-03-15 23:14:45] [INFO ] After 1136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:14:46] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 719 ms returned sat
[2023-03-15 23:14:47] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:14:47] [INFO ] After 1525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-15 23:14:47] [INFO ] After 2798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 247 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:14:48] [INFO ] Invariant cache hit.
[2023-03-15 23:14:54] [INFO ] Implicit Places using invariants in 5863 ms returned []
[2023-03-15 23:14:54] [INFO ] Invariant cache hit.
[2023-03-15 23:15:06] [INFO ] Implicit Places using invariants and state equation in 12220 ms returned []
Implicit Place search using SMT with State Equation took 18085 ms to find 0 implicit places.
[2023-03-15 23:15:06] [INFO ] Invariant cache hit.
[2023-03-15 23:15:08] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19804 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1406728 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :{}
Probabilistic random walk after 1406728 steps, saw 169293 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:15:12] [INFO ] Invariant cache hit.
[2023-03-15 23:15:13] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 738 ms returned sat
[2023-03-15 23:15:13] [INFO ] After 1176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:15:14] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 730 ms returned sat
[2023-03-15 23:15:15] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:15:16] [INFO ] After 1516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-15 23:15:16] [INFO ] After 2774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2675 reset in 442 ms.
Product exploration explored 100000 steps with 2682 reset in 447 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3603 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.13 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3602 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3602 transition count 502
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 5 place count 3602 transition count 504
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 5 rules in 876 ms. Remains 3602 /3703 variables (removed 101) and now considering 504/506 (removed 2) transitions.
[2023-03-15 23:15:18] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 504 rows 3602 cols
[2023-03-15 23:15:18] [INFO ] Computed 3104 place invariants in 16 ms
[2023-03-15 23:15:19] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3602/3703 places, 504/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2355 ms. Remains : 3602/3703 places, 504/506 transitions.
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 250 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 23:15:20] [INFO ] Computed 3200 place invariants in 434 ms
[2023-03-15 23:15:26] [INFO ] Implicit Places using invariants in 6310 ms returned []
[2023-03-15 23:15:26] [INFO ] Invariant cache hit.
[2023-03-15 23:15:38] [INFO ] Implicit Places using invariants and state equation in 11558 ms returned []
Implicit Place search using SMT with State Equation took 17869 ms to find 0 implicit places.
[2023-03-15 23:15:38] [INFO ] Invariant cache hit.
[2023-03-15 23:15:39] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19520 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 80181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(!p0) U p1) U p2)||G((G(p3)||X(p1))))))'
Support contains 1158 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 127 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:15:40] [INFO ] Computed 3232 place invariants in 33 ms
[2023-03-15 23:15:44] [INFO ] Implicit Places using invariants in 4559 ms returned []
[2023-03-15 23:15:44] [INFO ] Invariant cache hit.
[2023-03-15 23:15:50] [INFO ] Implicit Places using invariants and state equation in 5479 ms returned []
Implicit Place search using SMT with State Equation took 10042 ms to find 0 implicit places.
[2023-03-15 23:15:50] [INFO ] Invariant cache hit.
[2023-03-15 23:15:51] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11635 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s149 1)) (AND (GEQ s0 1) (GEQ s148 1)) (AND (GEQ s0 1) (GEQ s147 1)) (AND (GEQ s0 1) (GEQ s146 1)) (AND (GEQ s0 1) (GEQ s145 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 12188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X((p0 U p1)) U p1))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 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 3699 transition count 501
Applied a total of 5 rules in 534 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-15 23:15:52] [INFO ] Computed 3200 place invariants in 34 ms
[2023-03-15 23:15:58] [INFO ] Implicit Places using invariants in 5599 ms returned []
[2023-03-15 23:15:58] [INFO ] Invariant cache hit.
[2023-03-15 23:16:10] [INFO ] Implicit Places using invariants and state equation in 12098 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 17701 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3736 places, 501/506 transitions.
Applied a total of 0 rules in 264 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18500 ms. Remains : 3633/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-12 finished in 18554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:16:10] [INFO ] Computed 3232 place invariants in 36 ms
[2023-03-15 23:16:16] [INFO ] Implicit Places using invariants in 5914 ms returned []
[2023-03-15 23:16:16] [INFO ] Invariant cache hit.
[2023-03-15 23:16:27] [INFO ] Implicit Places using invariants and state equation in 10814 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16733 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 247 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17232 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 55 steps with 10 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 17323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:16:28] [INFO ] Invariant cache hit.
[2023-03-15 23:16:34] [INFO ] Implicit Places using invariants in 6013 ms returned []
[2023-03-15 23:16:34] [INFO ] Invariant cache hit.
[2023-03-15 23:16:45] [INFO ] Implicit Places using invariants and state equation in 11491 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17506 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18022 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s112 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 2678 reset in 292 ms.
Product exploration explored 100000 steps with 2677 reset in 327 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1475713 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1475713 steps, saw 177416 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 23:16:50] [INFO ] Computed 3200 place invariants in 445 ms
[2023-03-15 23:16:51] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 730 ms returned sat
[2023-03-15 23:16:53] [INFO ] After 1297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 23:16:53] [INFO ] After 1437ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-15 23:16:53] [INFO ] After 2639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 248 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:16:54] [INFO ] Invariant cache hit.
[2023-03-15 23:16:59] [INFO ] Implicit Places using invariants in 5550 ms returned []
[2023-03-15 23:16:59] [INFO ] Invariant cache hit.
[2023-03-15 23:17:10] [INFO ] Implicit Places using invariants and state equation in 10861 ms returned []
Implicit Place search using SMT with State Equation took 16413 ms to find 0 implicit places.
[2023-03-15 23:17:10] [INFO ] Invariant cache hit.
[2023-03-15 23:17:12] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18094 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1505519 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :{}
Probabilistic random walk after 1505519 steps, saw 180711 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:17:15] [INFO ] Invariant cache hit.
[2023-03-15 23:17:16] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 724 ms returned sat
[2023-03-15 23:17:18] [INFO ] After 1288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 23:17:18] [INFO ] After 1413ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-15 23:17:18] [INFO ] After 2612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2676 reset in 307 ms.
Product exploration explored 100000 steps with 2683 reset in 315 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 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 3669 transition count 506
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 518 ms. Remains 3669 /3703 variables (removed 34) and now considering 506/506 (removed 0) transitions.
[2023-03-15 23:17:20] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 506 rows 3669 cols
[2023-03-15 23:17:20] [INFO ] Computed 3168 place invariants in 730 ms
[2023-03-15 23:17:22] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2688 ms. Remains : 3669/3703 places, 506/506 transitions.
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 23:17:22] [INFO ] Computed 3200 place invariants in 431 ms
[2023-03-15 23:17:28] [INFO ] Implicit Places using invariants in 6225 ms returned []
[2023-03-15 23:17:28] [INFO ] Invariant cache hit.
[2023-03-15 23:17:39] [INFO ] Implicit Places using invariants and state equation in 10961 ms returned []
Implicit Place search using SMT with State Equation took 17188 ms to find 0 implicit places.
[2023-03-15 23:17:39] [INFO ] Invariant cache hit.
[2023-03-15 23:17:41] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18856 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 73398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U X(p1))||X(G(p2)))))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 23:17:41] [INFO ] Computed 3232 place invariants in 34 ms
[2023-03-15 23:17:46] [INFO ] Implicit Places using invariants in 5476 ms returned []
[2023-03-15 23:17:46] [INFO ] Invariant cache hit.
[2023-03-15 23:17:57] [INFO ] Implicit Places using invariants and state equation in 10799 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16294 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 241 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16779 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 7}]], initial=8, aps=[p2:(AND (GEQ s77 1) (GEQ s2305 1) (GEQ s2338 1) (GEQ s2506 1) (GEQ s2537 1) (GEQ s2572 1) (GEQ s2607 1) (GEQ s2647 1) (GEQ s2676 1) (GEQ s2705 1) (GEQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, 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-32-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 17129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLFireability-06
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3636 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.20 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3633 transition count 500
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3633 transition count 500
Applied a total of 6 rules in 1027 ms. Remains 3633 /3736 variables (removed 103) and now considering 500/506 (removed 6) transitions.
// Phase 1: matrix 500 rows 3633 cols
[2023-03-15 23:17:59] [INFO ] Computed 3136 place invariants in 23 ms
[2023-03-15 23:18:05] [INFO ] Implicit Places using invariants in 5505 ms returned []
[2023-03-15 23:18:05] [INFO ] Invariant cache hit.
[2023-03-15 23:18:14] [INFO ] Implicit Places using invariants and state equation in 9676 ms returned [2212, 2213, 2214, 2215, 2216, 2217, 2218, 2219, 2224, 2225, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 3276, 3277, 3278, 3279, 3280, 3281, 3282, 3283, 3606, 3609, 3610, 3611, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631, 3632]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15185 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3567/3736 places, 500/506 transitions.
Applied a total of 0 rules in 245 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 16457 ms. Remains : 3567/3736 places, 500/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s62 1) (LT s64 1) (LT s63 1) (LT s65 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s37 1) (LT s36 1) (LT s39 1) (LT s38 1) (LT s41 1) (LT s40 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2462 reset in 483 ms.
Product exploration explored 100000 steps with 2464 reset in 488 ms.
Computed a total of 3567 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3567 transition count 500
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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 338 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1866714 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1866714 steps, saw 223300 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 500 rows 3567 cols
[2023-03-15 23:18:20] [INFO ] Computed 3072 place invariants in 23 ms
[2023-03-15 23:18:21] [INFO ] [Real]Absence check using 0 positive and 3072 generalized place invariants in 686 ms returned sat
[2023-03-15 23:18:21] [INFO ] After 1066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:18:22] [INFO ] [Nat]Absence check using 0 positive and 3072 generalized place invariants in 688 ms returned sat
[2023-03-15 23:18:23] [INFO ] After 1291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:18:23] [INFO ] After 1436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-15 23:18:23] [INFO ] After 2592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 374 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3567 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Applied a total of 0 rules in 231 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-15 23:18:24] [INFO ] Invariant cache hit.
[2023-03-15 23:18:29] [INFO ] Implicit Places using invariants in 5364 ms returned []
[2023-03-15 23:18:29] [INFO ] Invariant cache hit.
[2023-03-15 23:18:39] [INFO ] Implicit Places using invariants and state equation in 9393 ms returned []
Implicit Place search using SMT with State Equation took 14763 ms to find 0 implicit places.
[2023-03-15 23:18:39] [INFO ] Invariant cache hit.
[2023-03-15 23:18:40] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16329 ms. Remains : 3567/3567 places, 500/500 transitions.
Computed a total of 3567 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3567 transition count 500
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1981481 steps, run timeout after 3001 ms. (steps per millisecond=660 ) properties seen :{}
Probabilistic random walk after 1981481 steps, saw 237256 distinct states, run finished after 3001 ms. (steps per millisecond=660 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:18:44] [INFO ] Invariant cache hit.
[2023-03-15 23:18:45] [INFO ] [Real]Absence check using 0 positive and 3072 generalized place invariants in 690 ms returned sat
[2023-03-15 23:18:45] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:18:46] [INFO ] [Nat]Absence check using 0 positive and 3072 generalized place invariants in 680 ms returned sat
[2023-03-15 23:18:47] [INFO ] After 1297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:18:47] [INFO ] After 1426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-15 23:18:48] [INFO ] After 2569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2461 reset in 498 ms.
Product exploration explored 100000 steps with 2461 reset in 503 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3567 transition count 500
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 261 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-15 23:18:49] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 500 rows 3567 cols
[2023-03-15 23:18:49] [INFO ] Computed 3072 place invariants in 18 ms
[2023-03-15 23:18:51] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3567/3567 places, 500/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1624 ms. Remains : 3567/3567 places, 500/500 transitions.
Support contains 33 out of 3567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Applied a total of 0 rules in 216 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 3567 cols
[2023-03-15 23:18:51] [INFO ] Computed 3072 place invariants in 23 ms
[2023-03-15 23:18:56] [INFO ] Implicit Places using invariants in 5452 ms returned []
[2023-03-15 23:18:56] [INFO ] Invariant cache hit.
[2023-03-15 23:19:05] [INFO ] Implicit Places using invariants and state equation in 9032 ms returned []
Implicit Place search using SMT with State Equation took 14486 ms to find 0 implicit places.
[2023-03-15 23:19:05] [INFO ] Invariant cache hit.
[2023-03-15 23:19:07] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16011 ms. Remains : 3567/3567 places, 500/500 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 68948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLFireability-14
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 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 3699 transition count 501
Applied a total of 5 rules in 542 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-15 23:19:08] [INFO ] Computed 3200 place invariants in 31 ms
[2023-03-15 23:19:13] [INFO ] Implicit Places using invariants in 5696 ms returned []
[2023-03-15 23:19:13] [INFO ] Invariant cache hit.
[2023-03-15 23:19:24] [INFO ] Implicit Places using invariants and state equation in 10788 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16488 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3633/3736 places, 501/506 transitions.
Applied a total of 0 rules in 262 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 17294 ms. Remains : 3633/3736 places, 501/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s112 1))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2468 reset in 355 ms.
Product exploration explored 100000 steps with 2467 reset in 367 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2067831 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :{}
Probabilistic random walk after 2067831 steps, saw 247267 distinct states, run finished after 3001 ms. (steps per millisecond=689 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3633 cols
[2023-03-15 23:19:29] [INFO ] Computed 3136 place invariants in 547 ms
[2023-03-15 23:19:30] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 707 ms returned sat
[2023-03-15 23:19:32] [INFO ] After 1254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 23:19:32] [INFO ] After 1379ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-15 23:19:32] [INFO ] After 2558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 252 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-15 23:19:33] [INFO ] Invariant cache hit.
[2023-03-15 23:19:38] [INFO ] Implicit Places using invariants in 5735 ms returned []
[2023-03-15 23:19:38] [INFO ] Invariant cache hit.
[2023-03-15 23:19:50] [INFO ] Implicit Places using invariants and state equation in 11770 ms returned []
Implicit Place search using SMT with State Equation took 17509 ms to find 0 implicit places.
[2023-03-15 23:19:50] [INFO ] Invariant cache hit.
[2023-03-15 23:19:51] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19079 ms. Remains : 3633/3633 places, 501/501 transitions.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
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 : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2075309 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :{}
Probabilistic random walk after 2075309 steps, saw 248062 distinct states, run finished after 3001 ms. (steps per millisecond=691 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:19:55] [INFO ] Invariant cache hit.
[2023-03-15 23:19:56] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 706 ms returned sat
[2023-03-15 23:19:57] [INFO ] After 1189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 23:19:58] [INFO ] After 1315ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-15 23:19:58] [INFO ] After 2469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2460 reset in 356 ms.
Product exploration explored 100000 steps with 2462 reset in 374 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 267 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-15 23:19:59] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 23:19:59] [INFO ] Invariant cache hit.
[2023-03-15 23:20:01] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1666 ms. Remains : 3633/3633 places, 501/501 transitions.
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 231 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-15 23:20:01] [INFO ] Invariant cache hit.
[2023-03-15 23:20:06] [INFO ] Implicit Places using invariants in 5407 ms returned []
[2023-03-15 23:20:06] [INFO ] Invariant cache hit.
[2023-03-15 23:20:18] [INFO ] Implicit Places using invariants and state equation in 11255 ms returned []
Implicit Place search using SMT with State Equation took 16664 ms to find 0 implicit places.
[2023-03-15 23:20:18] [INFO ] Invariant cache hit.
[2023-03-15 23:20:19] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18252 ms. Remains : 3633/3633 places, 501/501 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 72158 ms.
[2023-03-15 23:20:19] [INFO ] Flatten gal took : 90 ms
[2023-03-15 23:20:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 23:20:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 8 ms.
Total runtime 475256 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-32
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678922631707

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 3 QuasiCertifProtocol-PT-32-LTLFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-32-LTLFireability-14
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type SKEL/SRCH) for QuasiCertifProtocol-PT-32-LTLFireability-14
lola: result : false
lola: markings : 629352
lola: fired transitions : 2961189
lola: time used : 2.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1797 2/32 QuasiCertifProtocol-PT-32-LTLFireability-14 212826 m, 42565 m/sec, 1587284 t fired, .

Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1797 4/32 QuasiCertifProtocol-PT-32-LTLFireability-14 445772 m, 46589 m/sec, 3332157 t fired, .

Time elapsed: 15 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1797 6/32 QuasiCertifProtocol-PT-32-LTLFireability-14 658088 m, 42463 m/sec, 5043825 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1797 8/32 QuasiCertifProtocol-PT-32-LTLFireability-14 839298 m, 36242 m/sec, 6717144 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1797 9/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1005075 m, 33155 m/sec, 8372996 t fired, .

Time elapsed: 30 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1797 11/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1203675 m, 39720 m/sec, 10033732 t fired, .

Time elapsed: 35 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1797 13/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1427898 m, 44844 m/sec, 11714015 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1797 14/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1642151 m, 42850 m/sec, 13407982 t fired, .

Time elapsed: 45 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1797 16/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1819258 m, 35421 m/sec, 15028900 t fired, .

Time elapsed: 50 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1797 17/32 QuasiCertifProtocol-PT-32-LTLFireability-14 1985535 m, 33255 m/sec, 16634284 t fired, .

Time elapsed: 55 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1797 18/32 QuasiCertifProtocol-PT-32-LTLFireability-14 2162359 m, 35364 m/sec, 18247770 t fired, .

Time elapsed: 60 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1797 20/32 QuasiCertifProtocol-PT-32-LTLFireability-14 2382366 m, 44001 m/sec, 19888759 t fired, .

Time elapsed: 65 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1797 22/32 QuasiCertifProtocol-PT-32-LTLFireability-14 2599092 m, 43345 m/sec, 21550544 t fired, .

Time elapsed: 70 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/1797 23/32 QuasiCertifProtocol-PT-32-LTLFireability-14 2769426 m, 34066 m/sec, 23169640 t fired, .

Time elapsed: 75 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/1797 25/32 QuasiCertifProtocol-PT-32-LTLFireability-14 2942448 m, 34604 m/sec, 24758874 t fired, .

Time elapsed: 80 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 79/1797 26/32 QuasiCertifProtocol-PT-32-LTLFireability-14 3108078 m, 33126 m/sec, 26350023 t fired, .

Time elapsed: 85 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 84/1797 28/32 QuasiCertifProtocol-PT-32-LTLFireability-14 3332589 m, 44902 m/sec, 28031129 t fired, .

Time elapsed: 90 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 89/1797 30/32 QuasiCertifProtocol-PT-32-LTLFireability-14 3551525 m, 43787 m/sec, 29713225 t fired, .

Time elapsed: 95 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 94/1797 31/32 QuasiCertifProtocol-PT-32-LTLFireability-14 3725003 m, 34695 m/sec, 31350684 t fired, .

Time elapsed: 100 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-PT-32-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-32-LTLFireability-06
lola: time limit : 3495 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3495 2/32 QuasiCertifProtocol-PT-32-LTLFireability-06 218590 m, 43718 m/sec, 1628403 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3495 4/32 QuasiCertifProtocol-PT-32-LTLFireability-06 434195 m, 43121 m/sec, 3248005 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3495 6/32 QuasiCertifProtocol-PT-32-LTLFireability-06 634219 m, 40004 m/sec, 4850874 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3495 7/32 QuasiCertifProtocol-PT-32-LTLFireability-06 808828 m, 34921 m/sec, 6439781 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3495 9/32 QuasiCertifProtocol-PT-32-LTLFireability-06 971744 m, 32583 m/sec, 8022226 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3495 10/32 QuasiCertifProtocol-PT-32-LTLFireability-06 1144210 m, 34493 m/sec, 9591743 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3495 12/32 QuasiCertifProtocol-PT-32-LTLFireability-06 1353386 m, 41835 m/sec, 11155575 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3495 14/32 QuasiCertifProtocol-PT-32-LTLFireability-06 1567452 m, 42813 m/sec, 12751707 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3495 15/32 QuasiCertifProtocol-PT-32-LTLFireability-06 1741079 m, 34725 m/sec, 14302184 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3495 16/32 QuasiCertifProtocol-PT-32-LTLFireability-06 1905883 m, 32960 m/sec, 15848840 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3495 18/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2054106 m, 29644 m/sec, 17380712 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3495 19/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2252972 m, 39773 m/sec, 18920174 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3495 21/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2465735 m, 42552 m/sec, 20515873 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3495 23/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2656791 m, 38211 m/sec, 22065863 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3495 24/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2822675 m, 33176 m/sec, 23598446 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3495 25/32 QuasiCertifProtocol-PT-32-LTLFireability-06 2977798 m, 31024 m/sec, 25122775 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3495 27/32 QuasiCertifProtocol-PT-32-LTLFireability-06 3151607 m, 34761 m/sec, 26675789 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3495 28/32 QuasiCertifProtocol-PT-32-LTLFireability-06 3366979 m, 43074 m/sec, 28291194 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3495 30/32 QuasiCertifProtocol-PT-32-LTLFireability-06 3570465 m, 40697 m/sec, 29887379 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3495 32/32 QuasiCertifProtocol-PT-32-LTLFireability-06 3736936 m, 33294 m/sec, 31448980 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-PT-32-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-32-LTLFireability-06: LTL unknown AGGR
QuasiCertifProtocol-PT-32-LTLFireability-14: LTL unknown AGGR


Time elapsed: 210 secs. Pages in use: 32

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-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-PT-32, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948500908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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