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.r165-tall-167838849800044.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 itstools
Input is ERK-PT-100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838849800044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 26 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-LTLFireability-00
FORMULA_NAME ERK-PT-100000-LTLFireability-01
FORMULA_NAME ERK-PT-100000-LTLFireability-02
FORMULA_NAME ERK-PT-100000-LTLFireability-03
FORMULA_NAME ERK-PT-100000-LTLFireability-04
FORMULA_NAME ERK-PT-100000-LTLFireability-05
FORMULA_NAME ERK-PT-100000-LTLFireability-06
FORMULA_NAME ERK-PT-100000-LTLFireability-07
FORMULA_NAME ERK-PT-100000-LTLFireability-08
FORMULA_NAME ERK-PT-100000-LTLFireability-09
FORMULA_NAME ERK-PT-100000-LTLFireability-10
FORMULA_NAME ERK-PT-100000-LTLFireability-11
FORMULA_NAME ERK-PT-100000-LTLFireability-12
FORMULA_NAME ERK-PT-100000-LTLFireability-13
FORMULA_NAME ERK-PT-100000-LTLFireability-14
FORMULA_NAME ERK-PT-100000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679415803980

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ERK-PT-100000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 16:23:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 16:23:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:23:25] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-21 16:23:25] [INFO ] Transformed 11 places.
[2023-03-21 16:23:25] [INFO ] Transformed 11 transitions.
[2023-03-21 16:23:25] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ERK-PT-100000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:23:25] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-21 16:23:26] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-21 16:23:26] [INFO ] Invariant cache hit.
[2023-03-21 16:23:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-21 16:23:26] [INFO ] Invariant cache hit.
[2023-03-21 16:23:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-21 16:23:26] [INFO ] Flatten gal took : 13 ms
[2023-03-21 16:23:26] [INFO ] Flatten gal took : 7 ms
[2023-03-21 16:23:26] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 16:23:26] [INFO ] Invariant cache hit.
[2023-03-21 16:23:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-21 16:23:26] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 16:23:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-21 16:23:26] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 16:23:26] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-21 16:23:26] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 8 transition count 7
Applied a total of 7 rules in 8 ms. Remains 8 /11 variables (removed 3) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 8/11 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=3846 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 548587 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 548587 steps, saw 327637 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 16:23:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:23:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:23:32] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 16:23:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:23:32] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 16:23:32] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-21 16:23:32] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 200000 steps, including 0 resets, run visited all 3 properties in 1658 ms. (steps per millisecond=120 )
Parikh walk visited 3 properties in 1658 ms.
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)||G(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-21 16:23:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:23:34] [INFO ] Implicit Places using invariants in 27 ms returned [0, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1), p1:(OR (LT s1 1) (LT s2 1) (LT s4 1))], nbAcceptance=2, 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 131 steps with 0 reset in 8 ms.
FORMULA ERK-PT-100000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-00 finished in 250 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)||G(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:23:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 16:23:34] [INFO ] Implicit Places using invariants in 29 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LT s8 1) (LT s9 1)), p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-02 finished in 222 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 X(p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:34] [INFO ] Invariant cache hit.
[2023-03-21 16:23:34] [INFO ] Implicit Places using invariants in 33 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s4 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6198 reset in 188 ms.
Stack based approach found an accepted trace after 53 steps with 9 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-03 finished in 382 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 X(p0)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:35] [INFO ] Invariant cache hit.
[2023-03-21 16:23:35] [INFO ] Implicit Places using invariants in 25 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-04 finished in 251 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 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 9 transition count 8
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 7 place count 8 transition count 8
Applied a total of 7 rules in 23 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
[2023-03-21 16:23:35] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 16:23:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:23:35] [INFO ] Implicit Places using invariants in 48 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 8/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 7/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 53 ms :[p0]
Running random walk in product with property : ERK-PT-100000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-06 finished in 158 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 p1)))||(G(p2)&&F(p1))) U (!p3 U !p0)))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-21 16:23:35] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:23:35] [INFO ] Implicit Places using invariants in 43 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50 ms. Remains : 8/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 290 ms :[p0, (NOT p1), (AND p0 (NOT p1) p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p3 p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3 (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s3 1), p3:(OR (LT s6 1) (LT s7 1)), p2:(GEQ s4 1), p1:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-07 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 11 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2023-03-21 16:23:35] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2023-03-21 16:23:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-21 16:23:35] [INFO ] Implicit Places using invariants in 25 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/11 places, 7/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 5/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-08 finished in 130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:23:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 16:23:36] [INFO ] Implicit Places using invariants in 26 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s7 1) (GEQ s8 1)), p0:(OR (LT s7 1) (LT s8 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][false, false, false]]
Product exploration explored 100000 steps with 1330 reset in 88 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 16 in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-09 finished in 266 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(X(G(p1)))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:36] [INFO ] Invariant cache hit.
[2023-03-21 16:23:36] [INFO ] Implicit Places using invariants in 26 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (LT s3 1) (LT s5 1) (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-10 finished in 184 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&&F(!p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:36] [INFO ] Invariant cache hit.
[2023-03-21 16:23:36] [INFO ] Implicit Places using invariants in 29 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 138 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : ERK-PT-100000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s4 1), p0:(OR (GEQ s4 1) (AND (GEQ s7 1) (GEQ s8 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-11 finished in 195 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((!p1||X(F(p2))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:36] [INFO ] Invariant cache hit.
[2023-03-21 16:23:36] [INFO ] Implicit Places using invariants in 27 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s5 1), p2:(AND (GEQ s1 1) (GEQ s5 1)), p0:(AND (GEQ s6 1) (GEQ s7 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 79 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) (NOT p2) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLFireability-12 finished in 582 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((!p0||G(F(!p0))))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:37] [INFO ] Invariant cache hit.
[2023-03-21 16:23:37] [INFO ] Implicit Places using invariants in 29 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 223 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : ERK-PT-100000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s4 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]]
Product exploration explored 100000 steps with 5778 reset in 61 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-14 finished in 334 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&&X((G(!p0)&&p1))))&&X(G(!p2))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:23:37] [INFO ] Invariant cache hit.
[2023-03-21 16:23:37] [INFO ] Implicit Places using invariants in 30 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, true, p2, (OR (NOT p1) p0), true, p0]
Running random walk in product with property : ERK-PT-100000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s9 1)), p2:(OR (LT s0 1) (LT s1 1)), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 224 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 p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 474 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) p2 p0), true, p2, (OR (NOT p1) p0), true, p0]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:23:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:23:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:23:39] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-21 16:23:39] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-21 16:23:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:23:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:23:39] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:23:39] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-21 16:23:39] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 298209 steps, including 0 resets, run visited all 1 properties in 285 ms. (steps per millisecond=1046 )
Parikh walk visited 2 properties in 2089 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F p2)]
Knowledge based reduction with 10 factoid took 555 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p2 p0), true, p2, (OR (NOT p1) p0), true, p0]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) p2 p0), true, p2, (OR (NOT p1) p0), true, p0]
[2023-03-21 16:23:42] [INFO ] Invariant cache hit.
[2023-03-21 16:23:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Proved EG p0
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F p2), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 10 factoid took 282 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLFireability-15 finished in 4919 ms.
All properties solved by simple procedures.
Total runtime 17042 ms.

BK_STOP 1679415823538

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ERK-PT-100000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ERK-PT-100000, 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 r165-tall-167838849800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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