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.r071-smll-167814397600148.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 CircularTrains-PT-012, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 04:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-012-LTLFireability-00
FORMULA_NAME CircularTrains-PT-012-LTLFireability-01
FORMULA_NAME CircularTrains-PT-012-LTLFireability-02
FORMULA_NAME CircularTrains-PT-012-LTLFireability-03
FORMULA_NAME CircularTrains-PT-012-LTLFireability-04
FORMULA_NAME CircularTrains-PT-012-LTLFireability-05
FORMULA_NAME CircularTrains-PT-012-LTLFireability-06
FORMULA_NAME CircularTrains-PT-012-LTLFireability-07
FORMULA_NAME CircularTrains-PT-012-LTLFireability-08
FORMULA_NAME CircularTrains-PT-012-LTLFireability-09
FORMULA_NAME CircularTrains-PT-012-LTLFireability-10
FORMULA_NAME CircularTrains-PT-012-LTLFireability-11
FORMULA_NAME CircularTrains-PT-012-LTLFireability-12
FORMULA_NAME CircularTrains-PT-012-LTLFireability-13
FORMULA_NAME CircularTrains-PT-012-LTLFireability-14
FORMULA_NAME CircularTrains-PT-012-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678249279972

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=CircularTrains-PT-012
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:21:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:21:23] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-08 04:21:23] [INFO ] Transformed 24 places.
[2023-03-08 04:21:23] [INFO ] Transformed 12 transitions.
[2023-03-08 04:21:23] [INFO ] Parsed PT model containing 24 places and 12 transitions and 48 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-012-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 18 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:23] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-08 04:21:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-08 04:21:24] [INFO ] Invariant cache hit.
[2023-03-08 04:21:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-08 04:21:24] [INFO ] Invariant cache hit.
[2023-03-08 04:21:24] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 24/24 places, 12/12 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-03-08 04:21:24] [INFO ] Flatten gal took : 40 ms
[2023-03-08 04:21:24] [INFO ] Flatten gal took : 12 ms
[2023-03-08 04:21:24] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 04:21:25] [INFO ] Invariant cache hit.
[2023-03-08 04:21:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 04:21:25] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-08 04:21:25] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0||F(!p1)))) U ((!p1&&X(X((!p0||F(!p1)))))||X(X(G((!p0||F(!p1))))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:25] [INFO ] Invariant cache hit.
[2023-03-08 04:21:25] [INFO ] Implicit Places using invariants in 74 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 535 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s8 1) (GEQ s11 1)), p0:(AND (GEQ s13 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23092 reset in 534 ms.
Product exploration explored 100000 steps with 23169 reset in 382 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 p1 (NOT p0)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 383 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 729 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 309 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:29] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-08 04:21:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 04:21:29] [INFO ] Invariant cache hit.
[2023-03-08 04:21:29] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-08 04:21:29] [INFO ] Invariant cache hit.
[2023-03-08 04:21:29] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 21/21 places, 12/12 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), true]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 535 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 636 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 317 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 307 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 23206 reset in 215 ms.
Product exploration explored 100000 steps with 23110 reset in 294 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 219 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 21 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:33] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 04:21:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 21/21 places, 12/12 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:33] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-08 04:21:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 04:21:33] [INFO ] Invariant cache hit.
[2023-03-08 04:21:33] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 04:21:33] [INFO ] Invariant cache hit.
[2023-03-08 04:21:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 21/21 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-00 finished in 7565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(p0) U p1))&&(X(p3)||p2)))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:33] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:21:33] [INFO ] Implicit Places using invariants in 40 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 22/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s10 1) (LT s16 1)), p1:(AND (GEQ s13 1) (GEQ s19 1)), p3:(OR (LT s14 1) (LT s18 1)), p0:(AND (GEQ s10 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1598 reset in 129 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-01 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((X(X(G(!p0)))&&(!p1 U (p2||G(!p1))))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:33] [INFO ] Invariant cache hit.
[2023-03-08 04:21:33] [INFO ] Implicit Places using invariants in 42 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p0), (OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2)), p0, (AND (NOT p2) p1 p0), p0]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(OR p2 (NOT p1)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=6 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=7 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=7 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1)), p2:(AND (NOT (AND (GEQ s13 1) (GEQ s18 1))) (GEQ s2 1) (GEQ s7 1)), p1:(AND (GEQ s13 1) (GEQ s18 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9132 reset in 204 ms.
Stack based approach found an accepted trace after 258 steps with 25 reset with depth 18 and stack size 18 in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-02 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(G((X(F(p2))||p1)))))||p0)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:34] [INFO ] Invariant cache hit.
[2023-03-08 04:21:34] [INFO ] Implicit Places using invariants in 56 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), 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: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s18 1)), p1:(OR (LT s12 1) (LT s18 1)), p2:(OR (LT s4 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6540 reset in 162 ms.
Product exploration explored 100000 steps with 6551 reset in 203 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) (NOT p1) p2), true]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2023-03-08 04:21:36] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 04:21:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 04:21:36] [INFO ] Invariant cache hit.
[2023-03-08 04:21:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 04:21:36] [INFO ] Invariant cache hit.
[2023-03-08 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 20/20 places, 12/12 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 p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 6537 reset in 167 ms.
Product exploration explored 100000 steps with 6632 reset in 197 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2023-03-08 04:21:38] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-08 04:21:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 20/20 places, 12/12 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2023-03-08 04:21:38] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 04:21:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 04:21:38] [INFO ] Invariant cache hit.
[2023-03-08 04:21:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 04:21:38] [INFO ] Invariant cache hit.
[2023-03-08 04:21:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 20/20 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-04 finished in 4068 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(((p1||(G(p1) U p2))&&p0))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:38] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:21:38] [INFO ] Implicit Places using invariants in 61 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s19 1)), p1:(AND (GEQ s11 1) (GEQ s16 1)), p2:(AND (GEQ s5 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-05 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:38] [INFO ] Invariant cache hit.
[2023-03-08 04:21:38] [INFO ] Implicit Places using invariants in 69 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s5 1) (GEQ s20 1)), p0:(AND (GEQ s7 1) (GEQ s17 1) (OR (LT s11 1) (LT s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-07 finished in 260 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||X(!p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:39] [INFO ] Invariant cache hit.
[2023-03-08 04:21:39] [INFO ] Implicit Places using invariants in 55 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT 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:(AND (GEQ s13 1) (GEQ s18 1)), p0:(AND (GEQ s2 1) (GEQ s7 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 6 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-08 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:39] [INFO ] Invariant cache hit.
[2023-03-08 04:21:39] [INFO ] Implicit Places using invariants in 64 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s7 1) (AND (GEQ s6 1) (GEQ s16 1))), p1:(AND (GEQ s2 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-09 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)||X(p1))) U X(G((p0||G(p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:39] [INFO ] Invariant cache hit.
[2023-03-08 04:21:39] [INFO ] Implicit Places using invariants in 68 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 314 ms :[false, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 4}], [{ cond=p0, acceptance={0, 1} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(AND (GEQ s6 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4802 reset in 175 ms.
Stack based approach found an accepted trace after 1778 steps with 81 reset with depth 12 and stack size 12 in 7 ms.
FORMULA CircularTrains-PT-012-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-10 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:40] [INFO ] Invariant cache hit.
[2023-03-08 04:21:40] [INFO ] Implicit Places using invariants in 68 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Applied a total of 4 rules in 7 ms. Remains 19 /21 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 19 cols
[2023-03-08 04:21:40] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-08 04:21:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 04:21:40] [INFO ] Invariant cache hit.
[2023-03-08 04:21:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/24 places, 10/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 19/24 places, 10/12 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s16 1)), p0:(OR (NOT (OR (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s13 1) (GEQ s17 1)))) (NOT (AND (GEQ s3 1) (GEQ s8 1))))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12529 reset in 329 ms.
Product exploration explored 100000 steps with 12520 reset in 387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 424 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0)]
[2023-03-08 04:21:42] [INFO ] Invariant cache hit.
[2023-03-08 04:21:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-08 04:21:42] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 04:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 04:21:42] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:42] [INFO ] Added : 3 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:21:42] [INFO ] Invariant cache hit.
[2023-03-08 04:21:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 04:21:42] [INFO ] Invariant cache hit.
[2023-03-08 04:21:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 04:21:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:21:42] [INFO ] Invariant cache hit.
[2023-03-08 04:21:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 19/19 places, 10/10 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 566 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0)]
[2023-03-08 04:21:44] [INFO ] Invariant cache hit.
[2023-03-08 04:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-08 04:21:44] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 04:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 04:21:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:44] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 12491 reset in 230 ms.
Product exploration explored 100000 steps with 12569 reset in 263 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:21:44] [INFO ] Invariant cache hit.
[2023-03-08 04:21:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 04:21:44] [INFO ] Invariant cache hit.
[2023-03-08 04:21:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-08 04:21:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:21:44] [INFO ] Invariant cache hit.
[2023-03-08 04:21:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 19/19 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-11 finished in 4451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0||X((p1||F(G(p2)))))) U (G(F((!p0||X((p1||F(G(p2)))))))||(F((!p0||X((p1||F(G(p2))))))&&(p0 U (p3||G(p0)))))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:44] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:21:44] [INFO ] Implicit Places using invariants in 37 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s18 1)), p3:(AND (OR (LT s14 1) (LT s18 1)) (NOT (AND (GEQ s6 1) (GEQ s17 1)))), p2:(AND (GEQ s3 1) (GEQ s15 1)), p1:(AND (GEQ s1 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p3 p2 p1)
Knowledge based reduction with 6 factoid took 582 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-012-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-012-LTLFireability-12 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:45] [INFO ] Invariant cache hit.
[2023-03-08 04:21:46] [INFO ] Implicit Places using invariants in 65 ms returned [5, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/24 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 10
Applied a total of 4 rules in 4 ms. Remains 20 /22 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 20 cols
[2023-03-08 04:21:46] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 04:21:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 04:21:46] [INFO ] Invariant cache hit.
[2023-03-08 04:21:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/24 places, 10/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 20/24 places, 10/12 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s18 1)), p1:(AND (GEQ s0 1) (GEQ s17 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 20814 reset in 159 ms.
Product exploration explored 100000 steps with 20869 reset in 182 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) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 04:21:47] [INFO ] Invariant cache hit.
[2023-03-08 04:21:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:47] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-08 04:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 04:21:47] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:21:47] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:21:47] [INFO ] Invariant cache hit.
[2023-03-08 04:21:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 04:21:48] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-08 04:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 04:21:48] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:48] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:21:48] [INFO ] Invariant cache hit.
[2023-03-08 04:21:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 04:21:48] [INFO ] Invariant cache hit.
[2023-03-08 04:21:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 04:21:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:21:48] [INFO ] Invariant cache hit.
[2023-03-08 04:21:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 20/20 places, 10/10 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) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 318 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 367 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 04:21:49] [INFO ] Invariant cache hit.
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-08 04:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 04:21:49] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:49] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:21:49] [INFO ] Invariant cache hit.
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-08 04:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 04:21:49] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:21:49] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20734 reset in 161 ms.
Product exploration explored 100000 steps with 20737 reset in 181 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:21:50] [INFO ] Invariant cache hit.
[2023-03-08 04:21:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 04:21:50] [INFO ] Invariant cache hit.
[2023-03-08 04:21:50] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 04:21:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:21:50] [INFO ] Invariant cache hit.
[2023-03-08 04:21:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 20/20 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-13 finished in 4476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(F(p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:21:50] [INFO ] Implicit Places using invariants in 63 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s18 1)), p1:(AND (GEQ s2 1) (GEQ s7 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11836 reset in 153 ms.
Product exploration explored 100000 steps with 11843 reset in 177 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) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:52] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 04:21:52] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:52] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:21:52] [INFO ] Invariant cache hit.
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 04:21:52] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:52] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:52] [INFO ] Invariant cache hit.
[2023-03-08 04:21:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 04:21:52] [INFO ] Invariant cache hit.
[2023-03-08 04:21:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 04:21:52] [INFO ] Invariant cache hit.
[2023-03-08 04:21:52] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 21/21 places, 12/12 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) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 04:21:53] [INFO ] Invariant cache hit.
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 04:21:53] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:53] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:21:53] [INFO ] Invariant cache hit.
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 04:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:21:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 04:21:53] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:21:53] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11868 reset in 156 ms.
Product exploration explored 100000 steps with 11836 reset in 175 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 21 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:55] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-08 04:21:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 21/21 places, 12/12 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 04:21:55] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 04:21:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 04:21:55] [INFO ] Invariant cache hit.
[2023-03-08 04:21:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 04:21:55] [INFO ] Invariant cache hit.
[2023-03-08 04:21:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 21/21 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-14 finished in 4772 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) U X(X(X(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:21:55] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:21:55] [INFO ] Implicit Places using invariants in 50 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 22/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), p0]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=p0, acceptance={} source=8 dest: 5}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s18 1)), p1:(AND (GEQ s13 1) (GEQ s19 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, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-15 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0||F(!p1)))) U ((!p1&&X(X((!p0||F(!p1)))))||X(X(G((!p0||F(!p1))))))))'
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(X(X(G((X(F(p2))||p1)))))||p0)))'
Found a Lengthening insensitive property : CircularTrains-PT-012-LTLFireability-04
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 04:21:56] [INFO ] Invariant cache hit.
[2023-03-08 04:21:56] [INFO ] Implicit Places using invariants in 57 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 19 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 18 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 18 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 16 transition count 8
Applied a total of 8 rules in 7 ms. Remains 16 /20 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 16 cols
[2023-03-08 04:21:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 04:21:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 04:21:56] [INFO ] Invariant cache hit.
[2023-03-08 04:21:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 16/24 places, 8/12 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 166 ms. Remains : 16/24 places, 8/12 transitions.
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), 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: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s15 1)), p1:(OR (LT s11 1) (LT s15 1)), p2:(OR (LT s3 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8087 reset in 163 ms.
Product exploration explored 100000 steps with 8115 reset in 178 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) (NOT p1) p2), true]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 307 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 04:21:58] [INFO ] Invariant cache hit.
[2023-03-08 04:21:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 04:21:58] [INFO ] Invariant cache hit.
[2023-03-08 04:21:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 04:21:58] [INFO ] Invariant cache hit.
[2023-03-08 04:21:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 16/16 places, 8/8 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 p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 8098 reset in 162 ms.
Product exploration explored 100000 steps with 8146 reset in 179 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 04:22:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:22:00] [INFO ] Invariant cache hit.
[2023-03-08 04:22:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 16/16 places, 8/8 transitions.
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 04:22:00] [INFO ] Invariant cache hit.
[2023-03-08 04:22:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 04:22:00] [INFO ] Invariant cache hit.
[2023-03-08 04:22:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-08 04:22:00] [INFO ] Invariant cache hit.
[2023-03-08 04:22:00] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 16/16 places, 8/8 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-04 finished in 4767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(F(p1))))))'
Found a Shortening insensitive property : CircularTrains-PT-012-LTLFireability-14
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 04:22:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 04:22:01] [INFO ] Implicit Places using invariants in 56 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Applied a total of 4 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 19 cols
[2023-03-08 04:22:01] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 04:22:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 04:22:01] [INFO ] Invariant cache hit.
[2023-03-08 04:22:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 19/24 places, 10/12 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 163 ms. Remains : 19/24 places, 10/12 transitions.
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s16 1)), p1:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14201 reset in 153 ms.
Product exploration explored 100000 steps with 14366 reset in 168 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) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 04:22:03] [INFO ] Invariant cache hit.
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 04:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 04:22:03] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:22:03] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:22:03] [INFO ] Invariant cache hit.
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 04:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:22:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 04:22:03] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:22:03] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:22:03] [INFO ] Invariant cache hit.
[2023-03-08 04:22:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 04:22:03] [INFO ] Invariant cache hit.
[2023-03-08 04:22:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 04:22:03] [INFO ] Invariant cache hit.
[2023-03-08 04:22:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 19/19 places, 10/10 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) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 04:22:04] [INFO ] Invariant cache hit.
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 04:22:04] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:22:04] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 04:22:04] [INFO ] Invariant cache hit.
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:22:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 04:22:04] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 04:22:04] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 14287 reset in 150 ms.
Product exploration explored 100000 steps with 14308 reset in 172 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:22:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:22:05] [INFO ] Invariant cache hit.
[2023-03-08 04:22:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 19/19 places, 10/10 transitions.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 04:22:05] [INFO ] Invariant cache hit.
[2023-03-08 04:22:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 04:22:05] [INFO ] Invariant cache hit.
[2023-03-08 04:22:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 04:22:05] [INFO ] Invariant cache hit.
[2023-03-08 04:22:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 19/19 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-14 finished in 5016 ms.
[2023-03-08 04:22:05] [INFO ] Flatten gal took : 21 ms
[2023-03-08 04:22:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 04:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 12 transitions and 48 arcs took 0 ms.
Total runtime 42621 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-012
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA CircularTrains-PT-012-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-012-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-012-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-012-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-012-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678249327422

--------------------
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:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-012-LTLFireability-04
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-012-LTLFireability-04
lola: result : true
lola: markings : 734
lola: fired transitions : 1948
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 16 CircularTrains-PT-012-LTLFireability-14
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for CircularTrains-PT-012-LTLFireability-14
lola: result : true
lola: markings : 310
lola: fired transitions : 651
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-012-LTLFireability-00
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-012-LTLFireability-00
lola: result : true
lola: markings : 2267
lola: fired transitions : 6286
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 9 CircularTrains-PT-012-LTLFireability-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for CircularTrains-PT-012-LTLFireability-13
lola: result : true
lola: markings : 53
lola: fired transitions : 79
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 9 CircularTrains-PT-012-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type EXCL) for CircularTrains-PT-012-LTLFireability-13
lola: result : true
lola: markings : 49
lola: fired transitions : 73
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-012-LTLFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for CircularTrains-PT-012-LTLFireability-11
lola: result : true
lola: markings : 62
lola: fired transitions : 81
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-012-LTLFireability-00: LTL true LTL model checker
CircularTrains-PT-012-LTLFireability-04: LTL true LTL model checker
CircularTrains-PT-012-LTLFireability-11: LTL true LTL model checker
CircularTrains-PT-012-LTLFireability-13: CONJ true CONJ
CircularTrains-PT-012-LTLFireability-14: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

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