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.r073-smll-167814399200148.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 ltsminxred
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 r073-smll-167814399200148
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-012
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 16:28:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 16:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:28:01] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-08 16:28:01] [INFO ] Transformed 24 places.
[2023-03-08 16:28:01] [INFO ] Transformed 12 transitions.
[2023-03-08 16:28:01] [INFO ] Parsed PT model containing 24 places and 12 transitions and 48 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 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 13 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 16:28:02] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-08 16:28:02] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-08 16:28:02] [INFO ] Invariant cache hit.
[2023-03-08 16:28:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-08 16:28:02] [INFO ] Invariant cache hit.
[2023-03-08 16:28:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 24/24 places, 12/12 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-03-08 16:28:02] [INFO ] Flatten gal took : 24 ms
[2023-03-08 16:28:02] [INFO ] Flatten gal took : 8 ms
[2023-03-08 16:28:02] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 16:28:02] [INFO ] Invariant cache hit.
[2023-03-08 16:28:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 16:28:03] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-08 16:28:03] [INFO ] After 69ms 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 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:03] [INFO ] Invariant cache hit.
[2023-03-08 16:28:03] [INFO ] Implicit Places using invariants in 61 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 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 2 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 81 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 422 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 23148 reset in 367 ms.
Product exploration explored 100000 steps with 23240 reset in 244 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 439 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 243 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
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 483 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 506 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 238 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 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 16:28:06] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-08 16:28:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 16:28:06] [INFO ] Invariant cache hit.
[2023-03-08 16:28:06] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 16:28:06] [INFO ] Invariant cache hit.
[2023-03-08 16:28:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 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 396 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 231 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
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 609 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 232 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 234 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 226 ms :[(AND p1 p0), (AND p1 p0), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 23080 reset in 148 ms.
Product exploration explored 100000 steps with 23170 reset in 130 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 239 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 8 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 16:28:09] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-08 16:28:09] [INFO ] Dead Transitions using invariants and state equation in 52 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 68 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 16:28:09] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 16:28:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 16:28:09] [INFO ] Invariant cache hit.
[2023-03-08 16:28:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 16:28:09] [INFO ] Invariant cache hit.
[2023-03-08 16:28:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 21/21 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-00 finished in 6240 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 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 16:28:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:09] [INFO ] Implicit Places using invariants in 55 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 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 58 ms. Remains : 22/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 301 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 1564 reset in 134 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-01 finished in 522 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 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:10] [INFO ] Invariant cache hit.
[2023-03-08 16:28:10] [INFO ] Implicit Places using invariants in 52 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 LTL mode, iteration 1 : 21/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 355 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 9193 reset in 370 ms.
Stack based approach found an accepted trace after 241 steps with 20 reset with depth 28 and stack size 28 in 2 ms.
FORMULA CircularTrains-PT-012-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-02 finished in 813 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 16:28:11] [INFO ] Invariant cache hit.
[2023-03-08 16:28:11] [INFO ] Implicit Places using invariants in 67 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 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 71 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 196 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 6524 reset in 165 ms.
Product exploration explored 100000 steps with 6572 reset in 209 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 203 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 189 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 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
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 230 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 193 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 189 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 2 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 16:28:12] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 16:28:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 16:28:12] [INFO ] Invariant cache hit.
[2023-03-08 16:28:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 16:28:12] [INFO ] Invariant cache hit.
[2023-03-08 16:28:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 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 167 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 192 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 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 139 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 189 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 189 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 185 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 6461 reset in 99 ms.
Product exploration explored 100000 steps with 6451 reset in 275 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 187 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 4 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2023-03-08 16:28:14] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-08 16:28:14] [INFO ] Dead Transitions using invariants and state equation in 40 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 55 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 16:28:14] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 16:28:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 16:28:14] [INFO ] Invariant cache hit.
[2023-03-08 16:28:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-08 16:28:14] [INFO ] Invariant cache hit.
[2023-03-08 16:28:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 20/20 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-04 finished in 3793 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 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 16:28:14] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:14] [INFO ] Implicit Places using invariants in 45 ms returned [15, 20, 21]
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 47 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 95 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 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-05 finished in 160 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 16:28:15] [INFO ] Invariant cache hit.
[2023-03-08 16:28:15] [INFO ] Implicit Places using invariants in 44 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 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 46 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 129 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 188 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 16:28:15] [INFO ] Invariant cache hit.
[2023-03-08 16:28:15] [INFO ] Implicit Places using invariants in 41 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 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 49 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 124 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 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-08 finished in 189 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 16:28:15] [INFO ] Invariant cache hit.
[2023-03-08 16:28:15] [INFO ] Implicit Places using invariants in 49 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 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 61 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 154 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 131 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-09 finished in 363 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 16:28:15] [INFO ] Invariant cache hit.
[2023-03-08 16:28:15] [INFO ] Implicit Places using invariants in 41 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 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 56 ms. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 230 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 4831 reset in 109 ms.
Product exploration explored 100000 steps with 4766 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 754 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[false, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 20 cols
[2023-03-08 16:28:17] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 16:28:17] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-08 16:28:17] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 16:28:17] [INFO ] After 73ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 1024 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
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.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 9
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 6 place count 17 transition count 9
Applied a total of 6 rules in 6 ms. Remains 17 /20 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 17 cols
[2023-03-08 16:28:18] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 16:28:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 16:28:18] [INFO ] Invariant cache hit.
[2023-03-08 16:28:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 16:28:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:28:18] [INFO ] Invariant cache hit.
[2023-03-08 16:28:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 17/20 places, 9/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 p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 469 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
Finished random walk after 3 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 571 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), p0]
Product exploration explored 100000 steps with 5911 reset in 127 ms.
Stack based approach found an accepted trace after 998 steps with 58 reset with depth 10 and stack size 10 in 2 ms.
FORMULA CircularTrains-PT-012-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-10 finished in 4992 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 2 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 16:28:20] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:20] [INFO ] Implicit Places using invariants in 43 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 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 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 16:28:20] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-08 16:28:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 16:28:20] [INFO ] Invariant cache hit.
[2023-03-08 16:28:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 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 126 ms. Remains : 19/24 places, 10/12 transitions.
Stuttering acceptance computed with spot in 84 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 12496 reset in 200 ms.
Product exploration explored 100000 steps with 12491 reset in 246 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 281 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 75 ms :[(NOT p1), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
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 338 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 76 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
[2023-03-08 16:28:22] [INFO ] Invariant cache hit.
[2023-03-08 16:28:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-08 16:28:22] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 16:28:22] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 16:28:22] [INFO ] Added : 3 causal constraints over 1 iterations in 22 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 2 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 16:28:22] [INFO ] Invariant cache hit.
[2023-03-08 16:28:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 16:28:22] [INFO ] Invariant cache hit.
[2023-03-08 16:28:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 16:28:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:22] [INFO ] Invariant cache hit.
[2023-03-08 16:28:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 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 276 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 73 ms :[(NOT p1), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
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 455 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 74 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
[2023-03-08 16:28:23] [INFO ] Invariant cache hit.
[2023-03-08 16:28:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-08 16:28:23] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 16:28:23] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 16:28:23] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 12530 reset in 145 ms.
Product exploration explored 100000 steps with 12518 reset in 171 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 16:28:23] [INFO ] Invariant cache hit.
[2023-03-08 16:28:24] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 16:28:24] [INFO ] Invariant cache hit.
[2023-03-08 16:28:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 16:28:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:24] [INFO ] Invariant cache hit.
[2023-03-08 16:28:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 19/19 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-11 finished in 3366 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 16:28:24] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:24] [INFO ] Implicit Places using invariants in 105 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 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 0 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 108 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 122 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 125 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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 424 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 962 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 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:25] [INFO ] Invariant cache hit.
[2023-03-08 16:28:25] [INFO ] Implicit Places using invariants in 40 ms returned [5, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 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 3 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 16:28:25] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 16:28:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 16:28:25] [INFO ] Invariant cache hit.
[2023-03-08 16:28:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 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 138 ms. Remains : 20/24 places, 10/12 transitions.
Stuttering acceptance computed with spot in 116 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 20785 reset in 102 ms.
Product exploration explored 100000 steps with 20934 reset in 115 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 222 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 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
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))]
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 268 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 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 16:28:26] [INFO ] Invariant cache hit.
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-08 16:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 16:28:26] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:26] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:26] [INFO ] Invariant cache hit.
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-08 16:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 16:28:26] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:26] [INFO ] Added : 3 causal constraints over 1 iterations in 11 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 16:28:26] [INFO ] Invariant cache hit.
[2023-03-08 16:28:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 16:28:26] [INFO ] Invariant cache hit.
[2023-03-08 16:28:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 16:28:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:26] [INFO ] Invariant cache hit.
[2023-03-08 16:28:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 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 230 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 111 ms :[(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))]
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 268 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 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 16:28:27] [INFO ] Invariant cache hit.
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-08 16:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 16:28:27] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:27] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:27] [INFO ] Invariant cache hit.
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-08 16:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 16:28:27] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 16:28:27] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20932 reset in 99 ms.
Product exploration explored 100000 steps with 20951 reset in 121 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 16:28:28] [INFO ] Invariant cache hit.
[2023-03-08 16:28:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 16:28:28] [INFO ] Invariant cache hit.
[2023-03-08 16:28:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 16:28:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:28] [INFO ] Invariant cache hit.
[2023-03-08 16:28:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 20/20 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-13 finished in 3099 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 16:28:28] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:28] [INFO ] Implicit Places using invariants in 79 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 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 83 ms. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 241 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 11855 reset in 102 ms.
Product exploration explored 100000 steps with 11928 reset in 117 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 139 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 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
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 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 194 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 190 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 188 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 16:28:29] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 16:28:29] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:29] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:29] [INFO ] Invariant cache hit.
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 16:28:29] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 16:28:29] [INFO ] Added : 5 causal constraints over 1 iterations in 17 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 16:28:29] [INFO ] Invariant cache hit.
[2023-03-08 16:28:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 16:28:29] [INFO ] Invariant cache hit.
[2023-03-08 16:28:29] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 16:28:29] [INFO ] Invariant cache hit.
[2023-03-08 16:28:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 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 136 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 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 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 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 189 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 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 16:28:30] [INFO ] Invariant cache hit.
[2023-03-08 16:28:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:30] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 16:28:30] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 16:28:30] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:30] [INFO ] Invariant cache hit.
[2023-03-08 16:28:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:31] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 16:28:31] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:31] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 190 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 11930 reset in 100 ms.
Product exploration explored 100000 steps with 11840 reset in 116 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 189 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 3 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-08 16:28:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2023-03-08 16:28:31] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-08 16:28:31] [INFO ] Dead Transitions using invariants and state equation in 36 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 47 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 16:28:31] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 16:28:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 16:28:31] [INFO ] Invariant cache hit.
[2023-03-08 16:28:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 16:28:31] [INFO ] Invariant cache hit.
[2023-03-08 16:28:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 21/21 places, 12/12 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-14 finished in 3672 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 16:28:31] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:28:31] [INFO ] Implicit Places using invariants in 36 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 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 0 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 308 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 3 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-15 finished in 390 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 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)]
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 16:28:32] [INFO ] Invariant cache hit.
[2023-03-08 16:28:32] [INFO ] Implicit Places using invariants in 43 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 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 4 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 16:28:32] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 16:28:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 16:28:32] [INFO ] Invariant cache hit.
[2023-03-08 16:28:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 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 113 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 8085 reset in 104 ms.
Product exploration explored 100000 steps with 8071 reset in 118 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 183 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 270 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 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
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 228 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 189 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 195 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 0 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 16:28:34] [INFO ] Invariant cache hit.
[2023-03-08 16:28:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 16:28:34] [INFO ] Invariant cache hit.
[2023-03-08 16:28:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 16:28:34] [INFO ] Invariant cache hit.
[2023-03-08 16:28:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 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 92 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 190 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 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p2), true]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 135 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 184 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 184 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 184 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 8249 reset in 98 ms.
Product exploration explored 100000 steps with 8128 reset in 115 ms.
Applying partial POR strategy [false, false, false, true, true]
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)]
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 16:28:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:35] [INFO ] Invariant cache hit.
[2023-03-08 16:28:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 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 0 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 16:28:35] [INFO ] Invariant cache hit.
[2023-03-08 16:28:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 16:28:35] [INFO ] Invariant cache hit.
[2023-03-08 16:28:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 16:28:35] [INFO ] Invariant cache hit.
[2023-03-08 16:28:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 16/16 places, 8/8 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-04 finished in 3434 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 185 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 16:28:36] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 16:28:36] [INFO ] Implicit Places using invariants in 45 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 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 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 1 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 16:28:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 16:28:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 16:28:36] [INFO ] Invariant cache hit.
[2023-03-08 16:28:36] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 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 132 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 14279 reset in 99 ms.
Product exploration explored 100000 steps with 14331 reset in 113 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 135 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 :[(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 180 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 184 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 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 16:28:37] [INFO ] Invariant cache hit.
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 16:28:37] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 16:28:37] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:37] [INFO ] Invariant cache hit.
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 16:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 16:28:37] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 16:28:37] [INFO ] Added : 3 causal constraints over 1 iterations in 9 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 0 ms. Remains 19 /19 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 16:28:37] [INFO ] Invariant cache hit.
[2023-03-08 16:28:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 16:28:37] [INFO ] Invariant cache hit.
[2023-03-08 16:28:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 16:28:37] [INFO ] Invariant cache hit.
[2023-03-08 16:28:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 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 137 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 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
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 321 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 188 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 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-08 16:28:38] [INFO ] Invariant cache hit.
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 16:28:38] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 16:28:38] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 16:28:38] [INFO ] Invariant cache hit.
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 16:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:28:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 16:28:38] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 16:28:38] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 186 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 14258 reset in 101 ms.
Product exploration explored 100000 steps with 14278 reset in 110 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 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 16:28:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:28:39] [INFO ] Invariant cache hit.
[2023-03-08 16:28:39] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 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 16:28:39] [INFO ] Invariant cache hit.
[2023-03-08 16:28:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 16:28:39] [INFO ] Invariant cache hit.
[2023-03-08 16:28:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 16:28:39] [INFO ] Invariant cache hit.
[2023-03-08 16:28:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 19/19 places, 10/10 transitions.
Treatment of property CircularTrains-PT-012-LTLFireability-14 finished in 3769 ms.
[2023-03-08 16:28:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 16:28:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 16:28:39] [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 38126 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3090/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3090/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3090/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3090/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3090/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CircularTrains-PT-012-LTLFireability-00
Could not compute solution for formula : CircularTrains-PT-012-LTLFireability-04
Could not compute solution for formula : CircularTrains-PT-012-LTLFireability-11
Could not compute solution for formula : CircularTrains-PT-012-LTLFireability-13
Could not compute solution for formula : CircularTrains-PT-012-LTLFireability-14

BK_STOP 1678292921274

--------------------
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
mcc2023
ltl formula name CircularTrains-PT-012-LTLFireability-00
ltl formula formula --ltl=/tmp/3090/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3090/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3090/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3090/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3090/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CircularTrains-PT-012-LTLFireability-04
ltl formula formula --ltl=/tmp/3090/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3090/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3090/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3090/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3090/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CircularTrains-PT-012-LTLFireability-11
ltl formula formula --ltl=/tmp/3090/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3090/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3090/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3090/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3090/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name CircularTrains-PT-012-LTLFireability-13
ltl formula formula --ltl=/tmp/3090/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3090/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3090/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3090/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3090/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55fc87dbd3f4]
1: pnml2lts-mc(+0xa2496) [0x55fc87dbd496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd30dd4b140]
3: pnml2lts-mc(+0x405be5) [0x55fc88120be5]
4: pnml2lts-mc(+0x16b3f9) [0x55fc87e863f9]
5: pnml2lts-mc(+0x164ac4) [0x55fc87e7fac4]
6: pnml2lts-mc(+0x272e0a) [0x55fc87f8de0a]
7: pnml2lts-mc(+0xb61f0) [0x55fc87dd11f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd30db9e4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd30db9e67a]
10: pnml2lts-mc(+0xa1581) [0x55fc87dbc581]
11: pnml2lts-mc(+0xa1910) [0x55fc87dbc910]
12: pnml2lts-mc(+0xa32a2) [0x55fc87dbe2a2]
13: pnml2lts-mc(+0xa50f4) [0x55fc87dc00f4]
14: pnml2lts-mc(+0x3f34b3) [0x55fc8810e4b3]
15: pnml2lts-mc(+0x7c63d) [0x55fc87d9763d]
16: pnml2lts-mc(+0x67d86) [0x55fc87d82d86]
17: pnml2lts-mc(+0x60a8a) [0x55fc87d7ba8a]
18: pnml2lts-mc(+0x5eb15) [0x55fc87d79b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd30db86d0a]
20: pnml2lts-mc(+0x6075e) [0x55fc87d7b75e]
ltl formula name CircularTrains-PT-012-LTLFireability-14
ltl formula formula --ltl=/tmp/3090/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 12 transitions and 48 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3090/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3090/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3090/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3090/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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 ltsminxred"
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 r073-smll-167814399200148"
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 ;