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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:44 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.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 10:46 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-C1000N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678538502965

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-C1000N0000000010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 12:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 12:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:41:44] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-11 12:41:44] [INFO ] Transformed 33 places.
[2023-03-11 12:41:44] [INFO ] Transformed 22 transitions.
[2023-03-11 12:41:44] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 78 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 1 formulas.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 8 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 12:41:44] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-11 12:41:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:44] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-11 12:41:44] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:44] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:44] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2023-03-11 12:41:45] [INFO ] Flatten gal took : 19 ms
[2023-03-11 12:41:45] [INFO ] Flatten gal took : 5 ms
[2023-03-11 12:41:45] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 20) seen :19
Finished Best-First random walk after 282 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
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(G((p0&&F((p1||X((!p2 U (p3||G(!p2))))))))))'
Support contains 6 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 12:41:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:45] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 113 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 1 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 151 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-00 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=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s22 1), p1:(GEQ s18 1), p3:(AND (GEQ s1 1) (GEQ s24 1) (NOT (AND (GEQ s2 1) (GEQ s21 1)))), p2:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-C1000N0000000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-00 finished in 485 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))&&(!p0 U p1)))'
Support contains 5 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 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 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: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 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 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Applied a total of 9 rules in 16 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 103 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/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 24 transition count 17
Applied a total of 2 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 24 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/33 places, 17/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 24/33 places, 17/22 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-01 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 3 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 0 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 9 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 12:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0, 2, 3, 15, 19]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 83 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 18 transition count 14
Applied a total of 6 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:46] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-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:(OR (LT s4 1) (LT s5 1) (LT s16 7000))], 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 518 reset in 205 ms.
Stack based approach found an accepted trace after 1013 steps with 5 reset with depth 16 and stack size 16 in 2 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-02 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
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 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 12:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 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 2 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 138 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s27 2000)), p0:(AND (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-03 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((!p1&&F(!p0)))))'
Support contains 3 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 8 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 12:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0, 2, 15, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 93 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/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 21 transition count 16
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 21/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), p0, (OR p1 p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s11 1), p1:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-04 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-04 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||F((p2||X(X(p0))))))'
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 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 12:41:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 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 1 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 105 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s8 1) (GEQ s9 1)), p0:(GEQ s11 1), p1:(AND (GEQ s2 1) (GEQ s21 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 8833 reset in 147 ms.
Product exploration explored 100000 steps with 8905 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 22 rows 31 cols
[2023-03-11 12:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:49] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-11 12:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:49] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-11 12:41:49] [INFO ] Computed and/alt/rep : 21/43/21 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 12:41:49] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 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 31 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 30 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 30 transition count 20
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 29 transition count 20
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 9 place count 26 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 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 14 place count 23 transition count 16
Applied a total of 14 rules in 6 ms. Remains 23 /31 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-11 12:41:49] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-11 12:41:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-11 12:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:49] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-11 12:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:49] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 16/22 transitions.
Applied a total of 0 rules in 2 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 98 ms. Remains : 21/31 places, 16/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 12:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-11 12:41:50] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 12:41:50] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10786 reset in 91 ms.
Product exploration explored 100000 steps with 10777 reset in 152 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 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 0 with 2 rules applied. Total rules applied 5 place count 18 transition count 14
Applied a total of 5 rules in 4 ms. Remains 18 /21 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-11 12:41:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 18/21 places, 14/16 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-05 finished in 2900 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 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 0 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 12:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 90 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 124 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s3 1) (GEQ s4 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-06 finished in 262 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 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 12:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:50] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 103 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 1 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 140 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-07 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:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-07 finished in 225 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((G(p0)||X((!p1 U (p2||G(!p1)))))))'
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 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 12:41:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 77 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 1 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 113 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s15 1), p2:(AND (NOT (AND (GEQ s2 1) (GEQ s21 1))) (GEQ s22 1)), p1:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-08 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(p0))&&F(!p1))||G(p0))))'
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.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 95 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 2 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 134 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s26 2000)), p0:(AND (GEQ s6 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6537 reset in 110 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-09 finished in 454 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||(p1&&X(X(p1))&&F((p2||X(p0)))))))'
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 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 12:41:51] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-11 12:41:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 76 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 1 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 110 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p1:(GEQ s11 1), p2:(GEQ s18 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-11 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&X(F(!p1))))))))'
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 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 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 77 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 108 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (OR (NOT p0) p1), p1]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 2), p1:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1767 reset in 184 ms.
Stack based approach found an accepted trace after 83 steps with 1 reset with depth 61 and stack size 61 in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-12 finished in 406 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 4 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 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
Applied a total of 13 rules in 8 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 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/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 22 transition count 15
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/33 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 22/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s11 1) (LT s3 1) (LT s6 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 45 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-13 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1 U p2))||X(X(G(!p3)))))'
Support contains 6 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 12:41:52] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 12:41:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 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 1 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 120 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 382 ms :[true, (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), (AND (NOT p2) p3), (AND (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), p3]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=p3, acceptance={} source=10 dest: 0}, { cond=(NOT p3), acceptance={} source=10 dest: 10}]], initial=8, aps=[p0:(GEQ s18 1), p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p1:(GEQ s19 1), p3:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-14 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 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 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 8 place count 28 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 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 25 transition count 16
Applied a total of 13 rules in 18 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 12:41:53] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-11 12:41:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:53] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2023-03-11 12:41:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:53] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 2, 3, 14, 18]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 158 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 16/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 13
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 17 cols
[2023-03-11 12:41:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:53] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2023-03-11 12:41:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 12:41:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 17/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s5 1)), p0:(LT s8 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, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-15 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||F((p2||X(X(p0))))))'
Found a Shortening insensitive property : GPPP-PT-C1000N0000000010-LTLFireability-05
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_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 0 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 7 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 12:41:54] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:54] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-11 12:41:54] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 2, 15, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 76 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/33 places, 17/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 21 transition count 16
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:54] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:54] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 167 ms. Remains : 21/33 places, 16/22 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s6 1), p1:(AND (GEQ s1 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10738 reset in 88 ms.
Product exploration explored 100000 steps with 10830 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 449 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:55] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 12:41:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-11 12:41:55] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 12:41:55] [INFO ] Added : 7 causal constraints over 2 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:55] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:55] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:55] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:55] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:55] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:55] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-11 12:41:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:55] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 21/21 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-11 12:41:56] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:41:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-11 12:41:56] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 12:41:56] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10768 reset in 78 ms.
Product exploration explored 100000 steps with 10777 reset in 70 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 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 0 with 2 rules applied. Total rules applied 5 place count 18 transition count 14
Applied a total of 5 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:56] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 12:41:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:56] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:56] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:56] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 12:41:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-11 12:41:56] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-11 12:41:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 18/21 places, 14/16 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-05 finished in 2956 ms.
[2023-03-11 12:41:56] [INFO ] Flatten gal took : 3 ms
[2023-03-11 12:41:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 12:41:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 12327 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPPP-PT-C1000N0000000010
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA GPPP-PT-C1000N0000000010-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678538526884

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/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-C1000N0000000010-LTLFireability-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
GPPP-PT-C1000N0000000010-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 14/32 GPPP-PT-C1000N0000000010-LTLFireability-05 1984579 m, 396915 m/sec, 8509695 t fired, .

Time elapsed: 5 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for GPPP-PT-C1000N0000000010-LTLFireability-05
lola: result : true
lola: markings : 2891557
lola: fired transitions : 16160991
lola: time used : 9.000000
lola: memory pages used : 19
lola: Portfolio finished: no open formulas

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


Time elapsed: 9 secs. Pages in use: 19

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-C1000N0000000010"
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-C1000N0000000010, 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-167838853700884"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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