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.r073-smll-167814399300252.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 ltsminxred
Input is ClientsAndServers-PT-N0010P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399300252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N0010P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678331052232

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P1
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 03:04:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 03:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:04:15] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-09 03:04:15] [INFO ] Transformed 25 places.
[2023-03-09 03:04:15] [INFO ] Transformed 18 transitions.
[2023-03-09 03:04:15] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 03:04:15] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 03:04:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-09 03:04:15] [INFO ] Invariant cache hit.
[2023-03-09 03:04:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-09 03:04:15] [INFO ] Invariant cache hit.
[2023-03-09 03:04:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2023-03-09 03:04:16] [INFO ] Flatten gal took : 24 ms
[2023-03-09 03:04:16] [INFO ] Flatten gal took : 8 ms
[2023-03-09 03:04:16] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 17) seen :16
Finished Best-First random walk after 525 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=105 )
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-02 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' '!(((p0 U p1)||G(p2)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 17 transition count 13
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 3 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Applied a total of 15 rules in 17 ms. Remains 16 /25 variables (removed 9) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-09 03:04:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 03:04:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 03:04:16] [INFO ] Invariant cache hit.
[2023-03-09 03:04:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-09 03:04:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:16] [INFO ] Invariant cache hit.
[2023-03-09 03:04:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/25 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 16/25 places, 12/18 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s3 1) (GEQ s10 1)), p0:(GEQ s13 1), p2:(OR (LT s5 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 19 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-00 finished in 576 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)) U G(p1)) U X(p2)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 03:04:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 03:04:17] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s16 1)), p2:(AND (GEQ s1 1) (GEQ s18 1)), p0:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25844 steps with 0 reset in 199 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-01 finished in 496 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 X((p1 U (p2 U p3))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 03:04:17] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 03:04:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 03:04:17] [INFO ] Invariant cache hit.
[2023-03-09 03:04:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-09 03:04:17] [INFO ] Invariant cache hit.
[2023-03-09 03:04:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(GEQ s18 1), p3:(AND (GEQ s3 1) (GEQ s14 1)), p1:(AND (GEQ s5 1) (GEQ s15 1)), p2:(GEQ s6 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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-03 finished in 426 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(((G((p0 U X(p1))) U p2) U p3))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 03:04:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:04:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 03:04:18] [INFO ] Invariant cache hit.
[2023-03-09 03:04:18] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-09 03:04:18] [INFO ] Invariant cache hit.
[2023-03-09 03:04:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 416 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p3), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s21 1) (GEQ s1 1) (GEQ s18 1)), p2:(OR (AND (GEQ s3 1) (GEQ s14 1)) (AND (GEQ s1 1) (GEQ s18 1))), p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19647 reset in 270 ms.
Product exploration explored 100000 steps with 19398 reset in 375 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 p3) (NOT p2) (NOT p0) p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT p3)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1112 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:04:21] [INFO ] Invariant cache hit.
[2023-03-09 03:04:21] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT p3)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND (NOT p3) p0 (NOT p2)))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p1) p0)), (F p2), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 19 factoid took 1537 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Stuttering acceptance computed with spot in 347 ms :[(NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
[2023-03-09 03:04:23] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT p3)), (X (X (NOT p2))), true, (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (G (NOT (AND (NOT p3) p0 (NOT p2)))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p1) p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 19 factoid took 614 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-04 finished in 5916 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)&&F(G(p1))))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 03:04:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 03:04:24] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8636 steps with 0 reset in 32 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-05 finished in 376 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(p0))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
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 2 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 03:04:24] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 03:04:24] [INFO ] Implicit Places using invariants in 34 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Applied a total of 4 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 03:04:24] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 03:04:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 03:04:24] [INFO ] Invariant cache hit.
[2023-03-09 03:04:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 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]]
Product exploration explored 100000 steps with 7465 reset in 131 ms.
Product exploration explored 100000 steps with 7437 reset in 104 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 130 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 39 ms :[(NOT p0)]
Finished random walk after 183 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=183 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-09 03:04:25] [INFO ] Invariant cache hit.
[2023-03-09 03:04:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 03:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-09 03:04:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:04:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 03:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 03:04:25] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 03:04:25] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 03:04:25] [INFO ] Invariant cache hit.
[2023-03-09 03:04:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 03:04:25] [INFO ] Invariant cache hit.
[2023-03-09 03:04:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-09 03:04:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:25] [INFO ] Invariant cache hit.
[2023-03-09 03:04:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 9/9 places, 6/6 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 37 ms :[(NOT p0)]
Finished random walk after 302 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=302 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-09 03:04:25] [INFO ] Invariant cache hit.
[2023-03-09 03:04:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 03:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 03:04:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:04:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 03:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 03:04:25] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 03:04:25] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7469 reset in 100 ms.
Product exploration explored 100000 steps with 7465 reset in 94 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 03:04:26] [INFO ] Invariant cache hit.
[2023-03-09 03:04:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 03:04:26] [INFO ] Invariant cache hit.
[2023-03-09 03:04:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 03:04:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:26] [INFO ] Invariant cache hit.
[2023-03-09 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 9/9 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-06 finished in 1906 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 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 03:04:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 03:04:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 03:04:26] [INFO ] Invariant cache hit.
[2023-03-09 03:04:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-09 03:04:26] [INFO ] Invariant cache hit.
[2023-03-09 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-07 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 s3 1) (GEQ s14 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]]
Product exploration explored 100000 steps with 15182 reset in 70 ms.
Product exploration explored 100000 steps with 15113 reset in 72 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 115 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 38 ms :[(NOT p0)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-09 03:04:27] [INFO ] Invariant cache hit.
[2023-03-09 03:04:27] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 03:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 03:04:27] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 03:04:27] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 13 transition count 10
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 3 with 6 rules applied. Total rules applied 22 place count 10 transition count 7
Applied a total of 22 rules in 6 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 03:04:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 03:04:27] [INFO ] Implicit Places using invariants in 24 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 9/21 places, 7/18 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 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 37 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 154 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 03:04:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 03:04:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 03:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 03:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:04:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 03:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 03:04:27] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 03:04:27] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25016 reset in 59 ms.
Product exploration explored 100000 steps with 25023 reset in 68 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-09 03:04:27] [INFO ] Invariant cache hit.
[2023-03-09 03:04:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 03:04:27] [INFO ] Invariant cache hit.
[2023-03-09 03:04:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 03:04:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:27] [INFO ] Invariant cache hit.
[2023-03-09 03:04:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-07 finished in 1602 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||F(!p1)))||((!p0||F(!p1))&&F((G(p2)||(p2&&F(G(!p3)))))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 16 transition count 12
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 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 7 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-09 03:04:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 03:04:27] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/25 places, 11/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 8
Applied a total of 6 rules in 3 ms. Remains 11 /14 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-09 03:04:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 03:04:28] [INFO ] Invariant cache hit.
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 11/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2) p3), (AND (NOT p2) p0 p1 p3), (AND p0 p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={2} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=5 dest: 5}]], initial=0, aps=[p2:(LT s7 1), p0:(AND (GEQ s3 1) (GEQ s6 1)), p1:(AND (GEQ s2 1) (GEQ s9 1)), p3:(GEQ s8 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2019 reset in 124 ms.
Stack based approach found an accepted trace after 268 steps with 6 reset with depth 54 and stack size 54 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-10 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' '!(X(X(G((F(p1)&&p0)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 03:04:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 03:04:28] [INFO ] Invariant cache hit.
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 03:04:28] [INFO ] Invariant cache hit.
[2023-03-09 03:04:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(AND (GEQ s1 1) (GEQ s18 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-11 finished in 324 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
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 2 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 5 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 03:04:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants in 29 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 03:04:28] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 03:04:28] [INFO ] Invariant cache hit.
[2023-03-09 03:04:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1490 steps with 0 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-12 finished in 154 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) U X(p1)) U p2))&&X(p1)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 03:04:28] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-09 03:04:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 03:04:29] [INFO ] Invariant cache hit.
[2023-03-09 03:04:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-09 03:04:29] [INFO ] Invariant cache hit.
[2023-03-09 03:04:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 282 ms :[p0, (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (GEQ s7 1) (GEQ s20 1)), p1:(AND (GEQ s3 1) (GEQ s14 1)), p2:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-13 finished in 488 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(p0))'
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)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0010P1-LTLFireability-07
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
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 3 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 11 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 03:04:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 03:04:29] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 41 ms. Remains : 9/25 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-07 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 s2 1) (GEQ s6 1))], 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][false, false]]
Product exploration explored 100000 steps with 25013 reset in 50 ms.
Product exploration explored 100000 steps with 24933 reset in 63 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 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 37 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 158 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 03:04:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 03:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 03:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 03:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:04:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 03:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 03:04:30] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 03:04:30] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-09 03:04:30] [INFO ] Invariant cache hit.
[2023-03-09 03:04:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 03:04:30] [INFO ] Invariant cache hit.
[2023-03-09 03:04:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-09 03:04:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:30] [INFO ] Invariant cache hit.
[2023-03-09 03:04:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 9/9 places, 7/7 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 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 38 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 143 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-09 03:04:30] [INFO ] Invariant cache hit.
[2023-03-09 03:04:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 03:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 03:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 03:04:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 03:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 03:04:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 03:04:31] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 03:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25136 reset in 55 ms.
Product exploration explored 100000 steps with 24977 reset in 63 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-09 03:04:31] [INFO ] Invariant cache hit.
[2023-03-09 03:04:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 03:04:31] [INFO ] Invariant cache hit.
[2023-03-09 03:04:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-09 03:04:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 03:04:31] [INFO ] Invariant cache hit.
[2023-03-09 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-07 finished in 1675 ms.
[2023-03-09 03:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:04:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 03:04:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 16292 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1435/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1435/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0010P1-LTLFireability-06
Could not compute solution for formula : ClientsAndServers-PT-N0010P1-LTLFireability-07

BK_STOP 1678331072615

--------------------
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
mcc2023
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-06
ltl formula formula --ltl=/tmp/1435/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562463b363f4]
1: pnml2lts-mc(+0xa2496) [0x562463b36496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f01cdfd2140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x84038) [0x7f01cde6e038]
4: pnml2lts-mc(+0x16b416) [0x562463bff416]
5: pnml2lts-mc(+0x164ac4) [0x562463bf8ac4]
6: pnml2lts-mc(+0x272e0a) [0x562463d06e0a]
7: pnml2lts-mc(+0xb61f0) [0x562463b4a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f01cde254d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f01cde2567a]
10: pnml2lts-mc(+0xa1581) [0x562463b35581]
11: pnml2lts-mc(+0xa1910) [0x562463b35910]
12: pnml2lts-mc(+0xa32a2) [0x562463b372a2]
13: pnml2lts-mc(+0xa50f4) [0x562463b390f4]
14: pnml2lts-mc(+0xa516b) [0x562463b3916b]
15: pnml2lts-mc(+0x3f34b3) [0x562463e874b3]
16: pnml2lts-mc(+0x7c63d) [0x562463b1063d]
17: pnml2lts-mc(+0x67d86) [0x562463afbd86]
18: pnml2lts-mc(+0x60a8a) [0x562463af4a8a]
19: pnml2lts-mc(+0x5eb15) [0x562463af2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f01cde0dd0a]
21: pnml2lts-mc(+0x6075e) [0x562463af475e]
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-07
ltl formula formula --ltl=/tmp/1435/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e6f44d63f4]
1: pnml2lts-mc(+0xa2496) [0x55e6f44d6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f148644d140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x84038) [0x7f14862e9038]
4: pnml2lts-mc(+0x16b416) [0x55e6f459f416]
5: pnml2lts-mc(+0x164ac4) [0x55e6f4598ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e6f46a6e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e6f44ea1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f14862a04d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f14862a067a]
10: pnml2lts-mc(+0xa1581) [0x55e6f44d5581]
11: pnml2lts-mc(+0xa1910) [0x55e6f44d5910]
12: pnml2lts-mc(+0xa32a2) [0x55e6f44d72a2]
13: pnml2lts-mc(+0xa50f4) [0x55e6f44d90f4]
14: pnml2lts-mc(+0x3f34b3) [0x55e6f48274b3]
15: pnml2lts-mc(+0x7c63d) [0x55e6f44b063d]
16: pnml2lts-mc(+0x67d86) [0x55e6f449bd86]
17: pnml2lts-mc(+0x60a8a) [0x55e6f4494a8a]
18: pnml2lts-mc(+0x5eb15) [0x55e6f4492b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1486288d0a]
20: pnml2lts-mc(+0x6075e) [0x55e6f449475e]

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="ClientsAndServers-PT-N0010P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ClientsAndServers-PT-N0010P1, 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 r073-smll-167814399300252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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