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.r487-tall-167912703200540.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 TCPcondis-PT-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703200540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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 TCPcondis-PT-30-LTLFireability-00
FORMULA_NAME TCPcondis-PT-30-LTLFireability-01
FORMULA_NAME TCPcondis-PT-30-LTLFireability-02
FORMULA_NAME TCPcondis-PT-30-LTLFireability-03
FORMULA_NAME TCPcondis-PT-30-LTLFireability-04
FORMULA_NAME TCPcondis-PT-30-LTLFireability-05
FORMULA_NAME TCPcondis-PT-30-LTLFireability-06
FORMULA_NAME TCPcondis-PT-30-LTLFireability-07
FORMULA_NAME TCPcondis-PT-30-LTLFireability-08
FORMULA_NAME TCPcondis-PT-30-LTLFireability-09
FORMULA_NAME TCPcondis-PT-30-LTLFireability-10
FORMULA_NAME TCPcondis-PT-30-LTLFireability-11
FORMULA_NAME TCPcondis-PT-30-LTLFireability-12
FORMULA_NAME TCPcondis-PT-30-LTLFireability-13
FORMULA_NAME TCPcondis-PT-30-LTLFireability-14
FORMULA_NAME TCPcondis-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679202592539

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=TCPcondis-PT-30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 05:09:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 05:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:09:54] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 05:09:54] [WARNING] Unknown XML tag in source file: size
[2023-03-19 05:09:54] [WARNING] Unknown XML tag in source file: color
[2023-03-19 05:09:54] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-19 05:09:54] [INFO ] Transformed 30 places.
[2023-03-19 05:09:54] [INFO ] Transformed 32 transitions.
[2023-03-19 05:09:54] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:09:54] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 05:09:54] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 05:09:54] [INFO ] Invariant cache hit.
[2023-03-19 05:09:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-19 05:09:54] [INFO ] Invariant cache hit.
[2023-03-19 05:09:54] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 27 out of 30 places after structural reductions.
[2023-03-19 05:09:54] [INFO ] Flatten gal took : 42 ms
[2023-03-19 05:09:54] [INFO ] Flatten gal took : 21 ms
[2023-03-19 05:09:55] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 21) seen :20
Finished Best-First random walk after 201 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
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' '!(G((X((F(p1)&&p0)) U (p2||X(X((p2 U p1)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:09:55] [INFO ] Invariant cache hit.
[2023-03-19 05:09:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 05:09:55] [INFO ] Invariant cache hit.
[2023-03-19 05:09:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 05:09:55] [INFO ] Invariant cache hit.
[2023-03-19 05:09:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s20 1)), p0:(AND (GEQ s13 1) (GEQ s25 1)), p1:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-00 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 13 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 05:09:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:09:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 05:09:56] [INFO ] Invariant cache hit.
[2023-03-19 05:09:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 05:09:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:09:56] [INFO ] Invariant cache hit.
[2023-03-19 05:09:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1883 reset in 274 ms.
Stack based approach found an accepted trace after 4103 steps with 72 reset with depth 28 and stack size 28 in 10 ms.
FORMULA TCPcondis-PT-30-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-01 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G(!p0)||G(p1))) U p2))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:09:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:09:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:09:56] [INFO ] Invariant cache hit.
[2023-03-19 05:09:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 05:09:56] [INFO ] Invariant cache hit.
[2023-03-19 05:09:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s2 1) (GEQ s20 1)), p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 373 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 p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 302 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 5) seen :4
Finished Best-First random walk after 347 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=173 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 386 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:09:58] [INFO ] Invariant cache hit.
[2023-03-19 05:09:59] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-19 05:09:59] [INFO ] Invariant cache hit.
[2023-03-19 05:09:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-19 05:09:59] [INFO ] Invariant cache hit.
[2023-03-19 05:10:00] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1635 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 538 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 5) seen :4
Finished Best-First random walk after 155 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 490 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 343 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 7 rules in 13 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 05:10:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 05:10:03] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-19 05:10:03] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 29/30 places, 31/32 transitions.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:10:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-30-LTLFireability-02 finished in 6704 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))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-30-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-30-LTLFireability-03 finished in 409 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(G(p0))&&F(((!p1&&X(!p2))||G(!p2))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 05:10:03] [INFO ] Invariant cache hit.
[2023-03-19 05:10:03] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s26 1)), p2:(GEQ s15 1), p1:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 102 reset in 227 ms.
Stack based approach found an accepted trace after 95707 steps with 102 reset with depth 596 and stack size 596 in 231 ms.
FORMULA TCPcondis-PT-30-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-04 finished in 748 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))&&(!p1 U (p2||G(!p1)))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (AND (GEQ s5 1) (GEQ s23 1))) (NOT (OR (GEQ s9 1) (AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)) (GEQ s1 1)))), p1:(OR (GEQ s9 1) (AND (GEQ s10 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 11 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-06 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(G(p0))&&p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 05:10:04] [INFO ] Invariant cache hit.
[2023-03-19 05:10:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s6 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-07 finished in 309 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(!p0)||(!p0&&G(p1))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, p0, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(LT s24 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 13 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-08 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 10 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 05:10:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 05:10:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13582 reset in 108 ms.
Stack based approach found an accepted trace after 335 steps with 45 reset with depth 12 and stack size 12 in 1 ms.
FORMULA TCPcondis-PT-30-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-09 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
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 15 place count 23 transition count 24
Applied a total of 15 rules in 4 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 05:10:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 05:10:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18071 reset in 95 ms.
Stack based approach found an accepted trace after 4425 steps with 793 reset with depth 18 and stack size 18 in 6 ms.
FORMULA TCPcondis-PT-30-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-10 finished in 236 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(F(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 05:10:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 05:10:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:10:05] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 258 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 419 reset in 166 ms.
Stack based approach found an accepted trace after 2884 steps with 13 reset with depth 387 and stack size 387 in 6 ms.
FORMULA TCPcondis-PT-30-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-11 finished in 543 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 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 6 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 05:10:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 05:10:06] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-19 05:10:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:10:06] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s19 1) (GEQ s20 1) (GEQ s5 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 187 ms.
Stack based approach found an accepted trace after 6882 steps with 0 reset with depth 6883 and stack size 6883 in 16 ms.
FORMULA TCPcondis-PT-30-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-12 finished in 371 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)&&X(F(p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:10:06] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:10:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 05:10:06] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 05:10:06] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s14 1), p1:(OR (GEQ s0 1) (LT s13 1) (LT s25 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 694 reset in 183 ms.
Product exploration explored 100000 steps with 617 reset in 199 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 p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 439 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=439 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 05:10:08] [INFO ] Invariant cache hit.
[2023-03-19 05:10:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:08] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 05:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 05:10:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:10:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:08] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 05:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:10:08] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:10:08] [INFO ] Added : 24 causal constraints over 5 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:08] [INFO ] Invariant cache hit.
[2023-03-19 05:10:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 05:10:08] [INFO ] Invariant cache hit.
[2023-03-19 05:10:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 05:10:08] [INFO ] Invariant cache hit.
[2023-03-19 05:10:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 498 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=166 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 05:10:09] [INFO ] Invariant cache hit.
[2023-03-19 05:10:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:09] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 05:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:10:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:10:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:09] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 05:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:10:09] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:10:09] [INFO ] Added : 24 causal constraints over 5 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 628 reset in 190 ms.
Product exploration explored 100000 steps with 692 reset in 189 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 11 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 05:10:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 05:10:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 29/30 places, 31/32 transitions.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:10:10] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:10:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 05:10:10] [INFO ] Invariant cache hit.
[2023-03-19 05:10:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 05:10:10] [INFO ] Invariant cache hit.
[2023-03-19 05:10:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-30-LTLFireability-13 finished in 3400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(!p0) U (p1 U p2)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:10] [INFO ] Invariant cache hit.
[2023-03-19 05:10:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:10:10] [INFO ] Invariant cache hit.
[2023-03-19 05:10:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 05:10:10] [INFO ] Invariant cache hit.
[2023-03-19 05:10:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 64 ms.
Product exploration explored 100000 steps with 20000 reset in 71 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 p2 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Finished random walk after 6614 steps, including 1 resets, run visited all 7 properties in 9 ms. (steps per millisecond=734 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:12] [INFO ] Invariant cache hit.
[2023-03-19 05:10:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:10:12] [INFO ] Invariant cache hit.
[2023-03-19 05:10:12] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 05:10:12] [INFO ] Invariant cache hit.
[2023-03-19 05:10:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Finished random walk after 5246 steps, including 1 resets, run visited all 7 properties in 8 ms. (steps per millisecond=655 )
Knowledge obtained : [(AND (NOT p0) p2 p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 391 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 70 ms.
Product exploration explored 100000 steps with 20000 reset in 68 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p2)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 30/32 (removed 2) transitions.
[2023-03-19 05:10:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 30 cols
[2023-03-19 05:10:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 30/32 transitions.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:10:14] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:10:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 05:10:14] [INFO ] Invariant cache hit.
[2023-03-19 05:10:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 05:10:14] [INFO ] Invariant cache hit.
[2023-03-19 05:10:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-30-LTLFireability-14 finished in 4284 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((X(p1)||p0))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:10:14] [INFO ] Invariant cache hit.
[2023-03-19 05:10:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 05:10:14] [INFO ] Invariant cache hit.
[2023-03-19 05:10:14] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 05:10:14] [INFO ] Invariant cache hit.
[2023-03-19 05:10:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s4 1) (LT s21 1) (AND (GEQ s5 1) (GEQ s17 1))), p0:(OR (LT s3 1) (LT s19 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-30-LTLFireability-15 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G(!p0)||G(p1))) U p2))))'
Found a Lengthening insensitive property : TCPcondis-PT-30-LTLFireability-02
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Applied a total of 8 rules in 8 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2023-03-19 05:10:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:10:15] [INFO ] Invariant cache hit.
[2023-03-19 05:10:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-19 05:10:15] [INFO ] Invariant cache hit.
[2023-03-19 05:10:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 26/30 places, 28/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 96 ms. Remains : 26/30 places, 28/32 transitions.
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s1 1) (GEQ s18 1)), p1:(AND (GEQ s12 1) (GEQ s22 1) (GEQ s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 1 reset in 253 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 p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :4
Finished Best-First random walk after 320 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=160 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 408 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-19 05:10:16] [INFO ] Invariant cache hit.
[2023-03-19 05:10:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:10:17] [INFO ] Invariant cache hit.
[2023-03-19 05:10:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 05:10:17] [INFO ] Invariant cache hit.
[2023-03-19 05:10:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 26/26 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 5) seen :4
Finished Best-First random walk after 261 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=261 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 520 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 26 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-19 05:10:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2023-03-19 05:10:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 28/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 26/26 places, 28/28 transitions.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 26 cols
[2023-03-19 05:10:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:10:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 05:10:19] [INFO ] Invariant cache hit.
[2023-03-19 05:10:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 05:10:19] [INFO ] Invariant cache hit.
[2023-03-19 05:10:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 26/26 places, 28/28 transitions.
Treatment of property TCPcondis-PT-30-LTLFireability-02 finished in 4922 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)&&X(F(p1)))))'
Found a Shortening insensitive property : TCPcondis-PT-30-LTLFireability-13
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Applied a total of 8 rules in 13 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
[2023-03-19 05:10:19] [INFO ] Invariant cache hit.
[2023-03-19 05:10:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 05:10:19] [INFO ] Invariant cache hit.
[2023-03-19 05:10:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-19 05:10:19] [INFO ] Invariant cache hit.
[2023-03-19 05:10:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 26/30 places, 28/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 135 ms. Remains : 26/30 places, 28/32 transitions.
Running random walk in product with property : TCPcondis-PT-30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s13 1), p1:(OR (GEQ s0 1) (LT s12 1) (LT s22 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 758 reset in 171 ms.
Product exploration explored 100000 steps with 751 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 p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 280 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 05:10:21] [INFO ] Invariant cache hit.
[2023-03-19 05:10:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:21] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 05:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 05:10:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:10:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:21] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-19 05:10:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:10:21] [INFO ] Computed and/alt/rep : 24/93/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:10:21] [INFO ] Added : 23 causal constraints over 6 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-19 05:10:21] [INFO ] Invariant cache hit.
[2023-03-19 05:10:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:10:21] [INFO ] Invariant cache hit.
[2023-03-19 05:10:21] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 05:10:21] [INFO ] Invariant cache hit.
[2023-03-19 05:10:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 26/26 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 528 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=264 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 05:10:22] [INFO ] Invariant cache hit.
[2023-03-19 05:10:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 05:10:22] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-19 05:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 05:10:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:10:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-19 05:10:22] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-19 05:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:10:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:10:22] [INFO ] Computed and/alt/rep : 24/93/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:10:22] [INFO ] Added : 23 causal constraints over 6 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 668 reset in 177 ms.
Product exploration explored 100000 steps with 625 reset in 194 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 26 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-19 05:10:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2023-03-19 05:10:23] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:10:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 28/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 26/26 places, 28/28 transitions.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 26 cols
[2023-03-19 05:10:23] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:10:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:10:23] [INFO ] Invariant cache hit.
[2023-03-19 05:10:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 05:10:23] [INFO ] Invariant cache hit.
[2023-03-19 05:10:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 26/26 places, 28/28 transitions.
Treatment of property TCPcondis-PT-30-LTLFireability-13 finished in 3602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(!p0) U (p1 U p2)))))))'
[2023-03-19 05:10:23] [INFO ] Flatten gal took : 10 ms
[2023-03-19 05:10:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 05:10:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 29441 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TCPcondis-PT-30
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA TCPcondis-PT-30-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679202654562

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TCPcondis-PT-30-LTLFireability-02
lola: time limit : 1200 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
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TCPcondis-PT-30-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 15/32 TCPcondis-PT-30-LTLFireability-02 2214434 m, 442886 m/sec, 7911620 t fired, .

Time elapsed: 5 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TCPcondis-PT-30-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 28/32 TCPcondis-PT-30-LTLFireability-02 4191653 m, 395443 m/sec, 15435037 t fired, .

Time elapsed: 10 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for TCPcondis-PT-30-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TCPcondis-PT-30-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 TCPcondis-PT-30-LTLFireability-14
lola: time limit : 1792 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for TCPcondis-PT-30-LTLFireability-14
lola: result : true
lola: markings : 180
lola: fired transitions : 410
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 TCPcondis-PT-30-LTLFireability-13
lola: time limit : 3585 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-30-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3585 15/32 TCPcondis-PT-30-LTLFireability-13 2309292 m, 461858 m/sec, 7537152 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-30-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3585 28/32 TCPcondis-PT-30-LTLFireability-13 4358516 m, 409844 m/sec, 14844089 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for TCPcondis-PT-30-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-30-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-30-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TCPcondis-PT-30-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-30-LTLFireability-02: LTL unknown AGGR
TCPcondis-PT-30-LTLFireability-13: LTL unknown AGGR
TCPcondis-PT-30-LTLFireability-14: LTL true LTL model checker


Time elapsed: 30 secs. Pages in use: 32

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="TCPcondis-PT-30"
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 TCPcondis-PT-30, 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 r487-tall-167912703200540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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