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-167838853600788.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-C0001N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853600788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:38 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.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 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-C0001N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678526095065

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-C0001N0000000100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:14:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 09:14:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:14:56] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-11 09:14:56] [INFO ] Transformed 33 places.
[2023-03-11 09:14:56] [INFO ] Transformed 22 transitions.
[2023-03-11 09:14:56] [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 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 9 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:14:56] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-11 09:14:57] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
[2023-03-11 09:14:57] [INFO ] Invariant cache hit.
[2023-03-11 09:14:57] [INFO ] Implicit Places using invariants in 39 ms returned [0, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 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 0 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 408 ms. Remains : 30/33 places, 22/22 transitions.
Support contains 22 out of 30 places after structural reductions.
[2023-03-11 09:14:57] [INFO ] Flatten gal took : 16 ms
[2023-03-11 09:14:57] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:14:57] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 140 steps, including 0 resets, run visited all 16 properties in 15 ms. (steps per millisecond=9 )
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(G(p0)) U (G(p2)&&p1))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
// Phase 1: matrix 22 rows 30 cols
[2023-03-11 09:14:57] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 09:14:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-11 09:14:57] [INFO ] Invariant cache hit.
[2023-03-11 09:14:57] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 119 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s15 1)), p2:(GEQ s3 2), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 40 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-00 finished in 709 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)&&F(G(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 5 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 29 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 28 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 28 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 27 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 23 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 15
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 17 place count 20 transition count 14
Applied a total of 17 rules in 20 ms. Remains 20 /30 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-11 09:14:58] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 09:14:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:58] [INFO ] Implicit Places using invariants in 27 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 SI_LTL mode, iteration 1 : 18/30 places, 14/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 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 13
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 17 transition count 12
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 4 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 14 transition count 10
Applied a total of 8 rules in 3 ms. Remains 14 /18 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-11 09:14:58] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 09:14:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 09:14:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/30 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 14/30 places, 10/22 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1)), p1:(OR (LT s0 1) (LT s10 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-01 finished in 403 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 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
// Phase 1: matrix 22 rows 30 cols
[2023-03-11 09:14:58] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 09:14:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:58] [INFO ] Implicit Places using invariants in 39 ms returned [0, 16]
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 : 28/30 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 77 ms. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s3 2)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-02 finished in 161 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((X(p1)||p0))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:58] [INFO ] Implicit Places using invariants in 34 ms returned [16]
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 : 29/30 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 78 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 2) (LT s12 1) (LT s24 1)), p1:(AND (GEQ s0 7) (GEQ s21 7))], 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 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-03 finished in 530 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||X((F(p2)&&p1)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Implicit Places using invariants in 41 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 108 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(GEQ s16 1), p2:(OR (LT s7 1) (LT s8 1) (LT s27 7)), p1:(AND (GEQ s15 1) (GEQ s18 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-04 finished in 294 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)&&F(G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 3 edges and 30 vertex of which 2 / 30 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 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 28 transition count 20
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 8 place count 25 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 23 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 22 transition count 16
Applied a total of 13 rules in 10 ms. Remains 22 /30 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-11 09:14:59] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 09:14:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Implicit Places using invariants in 27 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 21/30 places, 16/22 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 7) (GEQ s13 7)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-05 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p0))&&(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
// Phase 1: matrix 22 rows 30 cols
[2023-03-11 09:14:59] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 09:14:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 09:14:59] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (LT s4 2) (NOT (AND (GEQ s0 1) (GEQ s23 1)))), p1:(AND (GEQ s0 1) (GEQ s23 1)), p0:(AND (GEQ s15 1) (GEQ s16 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 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-06 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 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.
[2023-03-11 09:15:00] [INFO ] Invariant cache hit.
[2023-03-11 09:15:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-11 09:15:00] [INFO ] Invariant cache hit.
[2023-03-11 09:15:00] [INFO ] Implicit Places using invariants in 29 ms returned [16]
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 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 71 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s22 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]]
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 85 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 29 cols
[2023-03-11 09:15:01] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 09:15:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 09:15:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 09:15:01] [INFO ] Computed and/alt/rep : 21/39/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 09:15:01] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 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.
[2023-03-11 09:15:01] [INFO ] Invariant cache hit.
[2023-03-11 09:15:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-11 09:15:01] [INFO ] Invariant cache hit.
[2023-03-11 09:15:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 09:15:01] [INFO ] Invariant cache hit.
[2023-03-11 09:15:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-11 09:15:01] [INFO ] Invariant cache hit.
[2023-03-11 09:15:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 29/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 09:15:02] [INFO ] Invariant cache hit.
[2023-03-11 09:15:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 09:15:02] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-11 09:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 09:15:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 09:15:02] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 09:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 09:15:02] [INFO ] Computed and/alt/rep : 21/39/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 09:15:02] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 28 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 27 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 27 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 11 ms. Remains 27 /29 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 27 cols
[2023-03-11 09:15:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 09:15:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-11 09:15:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:15:02] [INFO ] Invariant cache hit.
[2023-03-11 09:15:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/29 places, 20/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 27/29 places, 20/22 transitions.
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 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.
// Phase 1: matrix 22 rows 29 cols
[2023-03-11 09:15:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 09:15:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-11 09:15:02] [INFO ] Invariant cache hit.
[2023-03-11 09:15:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 09:15:02] [INFO ] Invariant cache hit.
[2023-03-11 09:15:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 09:15:02] [INFO ] Invariant cache hit.
[2023-03-11 09:15:02] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 29/29 places, 22/22 transitions.
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-07 finished in 2816 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 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 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 29 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 28 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 28 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 27 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 23 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 15
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 17 place count 20 transition count 14
Applied a total of 17 rules in 5 ms. Remains 20 /30 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-11 09:15:02] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 09:15:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants in 29 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/30 places, 14/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 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 13
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 17 transition count 12
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 4 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 14 transition count 10
Applied a total of 8 rules in 3 ms. Remains 14 /18 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-11 09:15:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/30 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 14/30 places, 10/22 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-08 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 s1 1) (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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-08 finished in 178 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(!X(p0)) U (G(p1) U p1)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
// Phase 1: matrix 22 rows 30 cols
[2023-03-11 09:15:03] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 09:15:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants in 25 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 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 66 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s0 7) (GEQ s21 7)), p1:(AND (GEQ s12 1) (GEQ s23 3))], 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 94 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-09 finished in 191 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&&X((!p0 U (G(!p0)||(!p1&&F(G(p0)))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants in 26 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 56 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 306 ms :[p0, p0, true, (AND p0 p1), (NOT p0), false]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s15 1)), p1:(AND (GEQ s11 1) (GEQ s23 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 93 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-10 finished in 470 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(p1)&&p0))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-11 09:15:03] [INFO ] Invariant cache hit.
[2023-03-11 09:15:03] [INFO ] Implicit Places using invariants in 24 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 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 60 ms. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s10 1)), p1:(AND (GEQ s0 1) (GEQ s11 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-11 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 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.
[2023-03-11 09:15:04] [INFO ] Invariant cache hit.
[2023-03-11 09:15:04] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-11 09:15:04] [INFO ] Invariant cache hit.
[2023-03-11 09:15:04] [INFO ] Implicit Places using invariants in 33 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 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 70 ms. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s3 2)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-15 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : GPPP-PT-C0001N0000000100-LTLFireability-07
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 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 29 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 28 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 28 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 27 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 23 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 15
Applied a total of 15 rules in 9 ms. Remains 21 /30 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 21 cols
[2023-03-11 09:15:04] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 09:15:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-11 09:15:04] [INFO ] Invariant cache hit.
[2023-03-11 09:15:04] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 20/30 places, 15/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 59 ms. Remains : 20/30 places, 15/22 transitions.
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ 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, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 42 ms.
Product exploration explored 100000 steps with 25000 reset in 55 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 15 rows 20 cols
[2023-03-11 09:15:05] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-11 09:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-11 09:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:15:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-11 09:15:05] [INFO ] Computed and/alt/rep : 14/28/14 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 09:15:05] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-11 09:15:05] [INFO ] Invariant cache hit.
[2023-03-11 09:15:05] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-11 09:15:05] [INFO ] Invariant cache hit.
[2023-03-11 09:15:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 09:15:05] [INFO ] Invariant cache hit.
[2023-03-11 09:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:15:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-11 09:15:05] [INFO ] Invariant cache hit.
[2023-03-11 09:15:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 20/20 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 09:15:05] [INFO ] Invariant cache hit.
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 09:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-11 09:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:15:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 09:15:06] [INFO ] Computed and/alt/rep : 14/28/14 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 09:15:06] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 150 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-11 09:15:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 20/20 places, 15/15 transitions.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:15:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:06] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 20/20 places, 15/15 transitions.
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-07 finished in 2553 ms.
[2023-03-11 09:15:06] [INFO ] Flatten gal took : 3 ms
[2023-03-11 09:15:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 09:15:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 22 transitions and 77 arcs took 1 ms.
Total runtime 10339 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPPP-PT-C0001N0000000100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA GPPP-PT-C0001N0000000100-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678526107763

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GPPP-PT-C0001N0000000100-LTLFireability-07: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000000100"
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-C0001N0000000100, 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-167838853600788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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