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.r487-tall-167912703200563.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 TCPcondis-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703200563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-50-LTLCardinality-00
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-01
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-02
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-03
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-04
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-05
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-06
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-07
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-08
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-09
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-10
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-11
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-12
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-13
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-14
FORMULA_NAME TCPcondis-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679203008685

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-50
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 05:16:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 05:16:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:16:50] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 05:16:50] [WARNING] Unknown XML tag in source file: size
[2023-03-19 05:16:50] [WARNING] Unknown XML tag in source file: color
[2023-03-19 05:16:50] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-19 05:16:50] [INFO ] Transformed 30 places.
[2023-03-19 05:16:50] [INFO ] Transformed 32 transitions.
[2023-03-19 05:16:50] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:16:50] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 05:16:50] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 05:16:50] [INFO ] Invariant cache hit.
[2023-03-19 05:16:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-19 05:16:50] [INFO ] Invariant cache hit.
[2023-03-19 05:16:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 20 out of 30 places after structural reductions.
[2023-03-19 05:16:50] [INFO ] Flatten gal took : 19 ms
[2023-03-19 05:16:50] [INFO ] Flatten gal took : 6 ms
[2023-03-19 05:16:50] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10049 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=279 ) properties (out of 26) seen :25
Finished Best-First random walk after 1206 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=241 )
FORMULA TCPcondis-PT-50-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 12 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 05:16:51] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:16:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:16:51] [INFO ] Invariant cache hit.
[2023-03-19 05:16:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 05:16:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:16:51] [INFO ] Invariant cache hit.
[2023-03-19 05:16:51] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 6515 steps with 0 reset with depth 6516 and stack size 6516 in 17 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-00 finished in 626 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((p0||(G(p1) U p2))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
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 16 place count 23 transition count 23
Applied a total of 16 rules in 10 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 05:16:51] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:16:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:16:51] [INFO ] Invariant cache hit.
[2023-03-19 05:16:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-19 05:16:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:16:52] [INFO ] Invariant cache hit.
[2023-03-19 05:16:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s8), p2:(AND (LEQ s15 s12) (GT 2 s6)), p1:(AND (LEQ 1 s8) (LEQ 2 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 639 steps with 0 reset in 8 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-01 finished in 311 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(G((F(p0) U p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 5 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2023-03-19 05:16:52] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-19 05:16:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:16:52] [INFO ] Invariant cache hit.
[2023-03-19 05:16:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 05:16:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 05:16:52] [INFO ] Invariant cache hit.
[2023-03-19 05:16:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ s18 s15) (LEQ 2 s6)), p0:(GT 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 685 reset in 294 ms.
Product exploration explored 100000 steps with 765 reset in 263 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:16:53] [INFO ] Invariant cache hit.
[2023-03-19 05:16:53] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:16:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:16:53] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 05:16:53] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:16:53] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 05:16:53] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-19 05:16:54] [INFO ] Invariant cache hit.
[2023-03-19 05:16:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 05:16:54] [INFO ] Invariant cache hit.
[2023-03-19 05:16:54] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-19 05:16:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:16:54] [INFO ] Invariant cache hit.
[2023-03-19 05:16:56] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2127 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:16:56] [INFO ] Invariant cache hit.
[2023-03-19 05:16:56] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:16:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:16:56] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 05:16:56] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:16:56] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 05:16:56] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 486 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 721 reset in 191 ms.
Stack based approach found an accepted trace after 65007 steps with 484 reset with depth 122 and stack size 122 in 136 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-02 finished in 5830 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(X(G(p0))))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:16:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:16:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:16:58] [INFO ] Invariant cache hit.
[2023-03-19 05:16:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 05:16:58] [INFO ] Invariant cache hit.
[2023-03-19 05:16:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-03 finished in 298 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(F(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:16:58] [INFO ] Invariant cache hit.
[2023-03-19 05:16:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:16:58] [INFO ] Invariant cache hit.
[2023-03-19 05:16:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-19 05:16:58] [INFO ] Invariant cache hit.
[2023-03-19 05:16:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s28 s6)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 808 reset in 194 ms.
Product exploration explored 100000 steps with 877 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:16:59] [INFO ] Invariant cache hit.
[2023-03-19 05:16:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:16:59] [INFO ] Invariant cache hit.
[2023-03-19 05:16:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 05:16:59] [INFO ] Invariant cache hit.
[2023-03-19 05:16:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 951 reset in 200 ms.
Product exploration explored 100000 steps with 756 reset in 208 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 28 transition count 30
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 12 rules in 10 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 05:17:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 05:17:01] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:17:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:17:01] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-50-LTLCardinality-04 finished in 2976 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(F((p0||G(F(p1)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s23 s19), p1:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-05 finished in 455 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 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-19 05:17:01] [INFO ] Invariant cache hit.
[2023-03-19 05:17:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s24)], 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]]
Product exploration explored 100000 steps with 696 reset in 181 ms.
Product exploration explored 100000 steps with 688 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1327 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=663 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-19 05:17:02] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-06 finished in 1138 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(F(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:17:02] [INFO ] Invariant cache hit.
[2023-03-19 05:17:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:17:02] [INFO ] Invariant cache hit.
[2023-03-19 05:17:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 05:17:03] [INFO ] Invariant cache hit.
[2023-03-19 05:17:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s15 s19)], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 56 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-07 finished in 413 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(G((F((X((X(p0)||p0))&&X(p1)))&&p2)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
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 9 place count 26 transition count 27
Applied a total of 9 rules in 9 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2023-03-19 05:17:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:17:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 05:17:03] [INFO ] Invariant cache hit.
[2023-03-19 05:17:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 05:17:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:17:03] [INFO ] Invariant cache hit.
[2023-03-19 05:17:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 s8), p1:(GT s21 s1), p0:(GT s20 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 110 reset in 184 ms.
Stack based approach found an accepted trace after 55522 steps with 55 reset with depth 58 and stack size 58 in 115 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-08 finished in 541 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' '!((p0 U ((X(!p1)&&F(p2)) U G(p2))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:17:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:17:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:17:03] [INFO ] Invariant cache hit.
[2023-03-19 05:17:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 05:17:03] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), p1, (NOT p2), (AND (NOT p2) p1), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s15), p0:(LEQ 2 s29), p1:(LEQ 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40833 steps with 13134 reset in 38 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-10 finished in 386 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((F(p0)&&G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ s14 s10), p0:(LEQ 1 s23)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-11 finished in 326 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(p0) U (p1||F((p1&&X(!p2)&&(p3||F(p4)))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 05:17:04] [INFO ] Invariant cache hit.
[2023-03-19 05:17:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 613 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p4) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) p2), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p3 (NOT p4)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p4) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p4) p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p3 (NOT p4) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND p1 p3 (NOT p4) p0), acceptance={} source=6 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p4) p2) (AND (NOT p3) (NOT p4) p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p3 (NOT p4) p2), acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0) p2) (AND (NOT p3) (NOT p4) (NOT p0) p2)), acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p4) p0 p2) (AND (NOT p3) (NOT p4) p0 p2)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p3 (NOT p4) (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 p3 (NOT p4) p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 3 s24), p0:(LEQ s16 s27), p3:(LEQ s17 s22), p4:(LEQ 3 s15), p2:(GT 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 401 reset in 214 ms.
Product exploration explored 100000 steps with 424 reset in 238 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 1824 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 9 states, 33 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :8
Finished Best-First random walk after 550 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=183 )
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p2 p0 (NOT p4)) (AND p2 p0 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0))), (F (OR (AND (NOT p1) p2 (NOT p0) (NOT p4)) (AND p2 (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 (NOT p3) (NOT p4))), (F (AND p1 p2 p3 (NOT p4))), (F (AND p1 p0)), (F (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0) (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2 p0 p3 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p2 (NOT p0) p3 (NOT p4))), (F (AND p1 p0 p3 (NOT p4))), (F (AND p1 (NOT p0) p3 (NOT p4))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p0 (NOT p3) (NOT p4))), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p3 (NOT p4))), (F (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 p2 p0 (NOT p3) (NOT p4))), (F (AND p1 p2 p0)), (F (AND p1 p2 (NOT p0) (NOT p3) (NOT p4))), (F (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) (NOT p4)))]
Knowledge based reduction with 32 factoid took 2565 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 9 states, 33 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
Stuttering acceptance computed with spot in 441 ms :[(NOT p1), (OR (NOT p1) p2 (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND p2 (NOT p4)), (AND (NOT p0) p2 (NOT p4))]
[2023-03-19 05:17:11] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0 p3 p4 p2), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p3) (NOT p4)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p4) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p4) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p4) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p2 p0 (NOT p4)) (AND p2 p0 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0))), (F (OR (AND (NOT p1) p2 (NOT p0) (NOT p4)) (AND p2 (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 (NOT p3) (NOT p4))), (F (AND p1 p2 p3 (NOT p4))), (F (AND p1 p0)), (F (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4)))), (F (AND p1 (NOT p0) (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2 p0 p3 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p2 (NOT p0) p3 (NOT p4))), (F (AND p1 p0 p3 (NOT p4))), (F (AND p1 (NOT p0) p3 (NOT p4))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p0 (NOT p3) (NOT p4))), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p3 (NOT p4))), (F (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND p1 p2 p0 (NOT p3) (NOT p4))), (F (AND p1 p2 p0)), (F (AND p1 p2 (NOT p0) (NOT p3) (NOT p4))), (F (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) (NOT p4))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 32 factoid took 1432 ms. Reduced automaton from 9 states, 33 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLCardinality-13 finished in 8514 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(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 9 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 05:17:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:17:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 05:17:13] [INFO ] Invariant cache hit.
[2023-03-19 05:17:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 05:17:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:17:13] [INFO ] Invariant cache hit.
[2023-03-19 05:17:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 28306 steps with 0 reset with depth 28307 and stack size 28294 in 55 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-14 finished in 378 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(!p0)||X((X(G(p1)) U (p2&&X(G(p1)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:17:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:17:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:17:13] [INFO ] Invariant cache hit.
[2023-03-19 05:17:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 05:17:13] [INFO ] Invariant cache hit.
[2023-03-19 05:17:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s12), p2:(LEQ 1 s14), p1:(LEQ s1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLCardinality-15 finished in 366 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(F(p0)))))'
Found a Shortening insensitive property : TCPcondis-PT-50-LTLCardinality-04
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Applied a total of 12 rules in 6 ms. Remains 24 /30 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 24 cols
[2023-03-19 05:17:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:17:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:17:14] [INFO ] Invariant cache hit.
[2023-03-19 05:17:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 05:17:14] [INFO ] Invariant cache hit.
[2023-03-19 05:17:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/30 places, 26/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 92 ms. Remains : 24/30 places, 26/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s23 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1057 reset in 161 ms.
Stack based approach found an accepted trace after 12465 steps with 61 reset with depth 5964 and stack size 5964 in 22 ms.
Treatment of property TCPcondis-PT-50-LTLCardinality-04 finished in 489 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 05:17:14] [INFO ] Flatten gal took : 7 ms
[2023-03-19 05:17:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 05:17:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 24120 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TCPcondis-PT-50
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA TCPcondis-PT-50-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679203035343

--------------------
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 LTLCardinality -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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TCPcondis-PT-50-LTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for TCPcondis-PT-50-LTLCardinality-04
lola: result : false
lola: markings : 772
lola: fired transitions : 821
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-50-LTLCardinality-04: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="TCPcondis-PT-50"
export BK_EXAMINATION="LTLCardinality"
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 TCPcondis-PT-50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912703200563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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