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.r167-tall-167838853600812.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is GPPP-PT-C0001N0000100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853600812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000100000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000100000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678528041944

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000100000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:47:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 09:47:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:47:23] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-11 09:47:23] [INFO ] Transformed 33 places.
[2023-03-11 09:47:23] [INFO ] Transformed 22 transitions.
[2023-03-11 09:47:23] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 09:47:23] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-11 09:47:23] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2023-03-11 09:47:23] [INFO ] Invariant cache hit.
[2023-03-11 09:47:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 09:47:23] [INFO ] Invariant cache hit.
[2023-03-11 09:47:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-11 09:47:23] [INFO ] Invariant cache hit.
[2023-03-11 09:47:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 27 out of 33 places after structural reductions.
[2023-03-11 09:47:24] [INFO ] Flatten gal took : 16 ms
[2023-03-11 09:47:24] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:47:24] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 102 steps, including 0 resets, run visited all 19 properties in 13 ms. (steps per millisecond=7 )
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-04 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' '!(X(F((F(p0)&&G(p1)&&F(G((p2 U p3)))))))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:47:24] [INFO ] Invariant cache hit.
[2023-03-11 09:47:24] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-11 09:47:24] [INFO ] Invariant cache hit.
[2023-03-11 09:47:24] [INFO ] Implicit Places using invariants in 31 ms returned [1, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p1) (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=(OR p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s18 1), p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 7)), p3:(AND (GEQ s13 1) (GEQ s24 3)), p2:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s10 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 263 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-01 finished in 791 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 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 18 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-11 09:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 09:47:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-11 09:47:25] [INFO ] Invariant cache hit.
[2023-03-11 09:47:25] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 15/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 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 0 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-11 09:47:25] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 09:47:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 09:47:25] [INFO ] Invariant cache hit.
[2023-03-11 09:47:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 09:47:25] [INFO ] Implicit Places using invariants and state equation in 34 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 : 17/33 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-02 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 s0 1) (GEQ s8 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-02 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F((X(G(p0))&&(!X(p1) U p2))))) U p1)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 09:47:25] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-11 09:47:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-11 09:47:25] [INFO ] Invariant cache hit.
[2023-03-11 09:47:25] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 44 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s8 1), p2:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s26 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1545 reset in 150 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-03 finished in 526 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 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 7 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-11 09:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 09:47:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-11 09:47:26] [INFO ] Invariant cache hit.
[2023-03-11 09:47:26] [INFO ] Implicit Places using invariants in 30 ms returned [0, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 15
Applied a total of 2 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 20 cols
[2023-03-11 09:47:26] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 09:47:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 09:47:26] [INFO ] Invariant cache hit.
[2023-03-11 09:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:47:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 20/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 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 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 76 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-07 finished in 368 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(X(F(p0)))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 09:47:26] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 09:47:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-11 09:47:26] [INFO ] Invariant cache hit.
[2023-03-11 09:47:26] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 42 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s2 1)) (AND (GEQ s5 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], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11422 reset in 184 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-08 finished in 493 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) U p1)||G((F(p2)&&X(X(G(p3)))))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:47:27] [INFO ] Invariant cache hit.
[2023-03-11 09:47:27] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-11 09:47:27] [INFO ] Invariant cache hit.
[2023-03-11 09:47:27] [INFO ] Implicit Places using invariants in 40 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 7}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s24 1)), p0:(AND (GEQ s1 7) (GEQ s23 7)), p2:(OR (GEQ s15 1) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1))), p3:(AND (GEQ s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7289 reset in 113 ms.
Stack based approach found an accepted trace after 83 steps with 12 reset with depth 20 and stack size 20 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-09 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:47:27] [INFO ] Invariant cache hit.
[2023-03-11 09:47:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-11 09:47:27] [INFO ] Invariant cache hit.
[2023-03-11 09:47:27] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s13 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 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 42 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-10 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:47:27] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-11 finished in 145 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(F(!p0)) U (p1||((p1&&X(p1)) U p2)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 39 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s16 1), p2:(GEQ s15 1), p0:(LT s13 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][false, false, false, false]]
Product exploration explored 100000 steps with 8487 reset in 82 ms.
Stack based approach found an accepted trace after 32695 steps with 2801 reset with depth 7 and stack size 7 in 29 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-13 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
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 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
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 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 12 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 09:47:28] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 2, 3, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 29 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 17/22 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 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 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 2 with 4 rules applied. Total rules applied 8 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 2 with 2 rules applied. Total rules applied 10 place count 16 transition count 12
Applied a total of 10 rules in 3 ms. Remains 16 /21 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-11 09:47:28] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 27 in 0 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-14 finished in 261 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((G(F(p0))||(G(p1)&&(F(p3)||p2))))))'
Support contains 10 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 09:47:28] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-11 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-11 09:47:28] [INFO ] Invariant cache hit.
[2023-03-11 09:47:28] [INFO ] Implicit Places using invariants in 28 ms returned [1, 3]
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 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : GPPP-PT-C0001N0000100000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=6 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (LT s17 1) (LT s20 1)), p0:(LT s14 1), p2:(OR (LT s0 1) (LT s1 1) (LT s10 1) (LT s30 1)), p3:(OR (LT s2 2) (LT s13 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 371 reset in 129 ms.
Stack based approach found an accepted trace after 700 steps with 1 reset with depth 638 and stack size 532 in 2 ms.
FORMULA GPPP-PT-C0001N0000100000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000100000-LTLFireability-15 finished in 667 ms.
All properties solved by simple procedures.
Total runtime 6070 ms.
ITS solved all properties within timeout

BK_STOP 1678528050445

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is GPPP-PT-C0001N0000100000, 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 r167-tall-167838853600812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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