Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397600164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CircularTrains-PT-048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 04:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 04:31 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 3.9K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 37K 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-048-LTLFireability-00
FORMULA_NAME CircularTrains-PT-048-LTLFireability-01
FORMULA_NAME CircularTrains-PT-048-LTLFireability-02
FORMULA_NAME CircularTrains-PT-048-LTLFireability-03
FORMULA_NAME CircularTrains-PT-048-LTLFireability-04
FORMULA_NAME CircularTrains-PT-048-LTLFireability-05
FORMULA_NAME CircularTrains-PT-048-LTLFireability-06
FORMULA_NAME CircularTrains-PT-048-LTLFireability-07
FORMULA_NAME CircularTrains-PT-048-LTLFireability-08
FORMULA_NAME CircularTrains-PT-048-LTLFireability-09
FORMULA_NAME CircularTrains-PT-048-LTLFireability-10
FORMULA_NAME CircularTrains-PT-048-LTLFireability-11
FORMULA_NAME CircularTrains-PT-048-LTLFireability-12
FORMULA_NAME CircularTrains-PT-048-LTLFireability-13
FORMULA_NAME CircularTrains-PT-048-LTLFireability-14
FORMULA_NAME CircularTrains-PT-048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678249719877

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-048
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:28:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:28:43] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-08 04:28:43] [INFO ] Transformed 96 places.
[2023-03-08 04:28:43] [INFO ] Transformed 48 transitions.
[2023-03-08 04:28:43] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 25 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2023-03-08 04:28:43] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-08 04:28:44] [INFO ] Implicit Places using invariants in 373 ms returned [1, 64, 84, 89, 92, 94]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 430 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 90/96 places, 48/48 transitions.
Support contains 44 out of 90 places after structural reductions.
[2023-03-08 04:28:44] [INFO ] Flatten gal took : 57 ms
[2023-03-08 04:28:44] [INFO ] Flatten gal took : 22 ms
[2023-03-08 04:28:44] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 90 cols
[2023-03-08 04:28:44] [INFO ] Computed 43 place invariants in 10 ms
[2023-03-08 04:28:44] [INFO ] After 55ms 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.
FORMULA CircularTrains-PT-048-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 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((p0&&F(G(p1)))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:28:45] [INFO ] Invariant cache hit.
[2023-03-08 04:28:45] [INFO ] Implicit Places using invariants in 201 ms returned [2, 12, 15, 21, 62, 79, 81, 86, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 202 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/90 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 81/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s21 1) (LT s51 1)), p1:(OR (LT s33 1) (LT s50 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 473 ms.
Product exploration explored 100000 steps with 0 reset in 517 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 p1), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be false thanks to negative knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLFireability-00 finished in 1747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 87 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 87 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 84 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 83 transition count 41
Applied a total of 14 rules in 27 ms. Remains 83 /90 variables (removed 7) and now considering 41/48 (removed 7) transitions.
// Phase 1: matrix 41 rows 83 cols
[2023-03-08 04:28:47] [INFO ] Computed 43 place invariants in 4 ms
[2023-03-08 04:28:47] [INFO ] Implicit Places using invariants in 194 ms returned [2, 12, 15, 21, 53, 59, 74, 76, 80]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 196 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/90 places, 41/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 74 transition count 35
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 68 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 68 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 66 transition count 33
Applied a total of 16 rules in 12 ms. Remains 66 /74 variables (removed 8) and now considering 33/41 (removed 8) transitions.
// Phase 1: matrix 33 rows 66 cols
[2023-03-08 04:28:47] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 04:28:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 04:28:47] [INFO ] Invariant cache hit.
[2023-03-08 04:28:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/90 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 483 ms. Remains : 66/90 places, 33/48 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s56 1) (GEQ s60 1)) (AND (GEQ s10 1) (GEQ s64 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10952 reset in 364 ms.
Product exploration explored 100000 steps with 10713 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 263 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-08 04:28:48] [INFO ] Invariant cache hit.
[2023-03-08 04:28:49] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-08 04:28:49] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:49] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 04:28:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:28:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 04:28:49] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:49] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-08 04:28:49] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 04:28:49] [INFO ] Added : 15 causal constraints over 3 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 9 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:28:49] [INFO ] Invariant cache hit.
[2023-03-08 04:28:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 04:28:49] [INFO ] Invariant cache hit.
[2023-03-08 04:28:49] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-08 04:28:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:28:49] [INFO ] Invariant cache hit.
[2023-03-08 04:28:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 66/66 places, 33/33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-08 04:28:50] [INFO ] Invariant cache hit.
[2023-03-08 04:28:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-08 04:28:50] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:50] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 04:28:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:28:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-08 04:28:50] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:50] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-08 04:28:50] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-08 04:28:50] [INFO ] Added : 15 causal constraints over 3 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10788 reset in 437 ms.
Product exploration explored 100000 steps with 10830 reset in 277 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 12 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:28:51] [INFO ] Invariant cache hit.
[2023-03-08 04:28:51] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 04:28:51] [INFO ] Invariant cache hit.
[2023-03-08 04:28:51] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-08 04:28:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:28:51] [INFO ] Invariant cache hit.
[2023-03-08 04:28:51] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 4987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 86 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 84 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 82 transition count 40
Applied a total of 16 rules in 10 ms. Remains 82 /90 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 82 cols
[2023-03-08 04:28:52] [INFO ] Computed 43 place invariants in 9 ms
[2023-03-08 04:28:52] [INFO ] Implicit Places using invariants in 118 ms returned [2, 12, 15, 21, 52, 58, 73, 75, 79, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 123 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/90 places, 40/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 72 transition count 35
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 64 transition count 32
Applied a total of 16 rules in 7 ms. Remains 64 /72 variables (removed 8) and now considering 32/40 (removed 8) transitions.
// Phase 1: matrix 32 rows 64 cols
[2023-03-08 04:28:52] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-08 04:28:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 04:28:52] [INFO ] Invariant cache hit.
[2023-03-08 04:28:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/90 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 64/90 places, 32/48 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s63 1)), p1:(AND (GEQ s16 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5479 reset in 285 ms.
Product exploration explored 100000 steps with 5504 reset in 278 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)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 383 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:28:54] [INFO ] Invariant cache hit.
[2023-03-08 04:28:54] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 04:28:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-08 04:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-08 04:28:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:28:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:28:54] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:54] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 04:28:54] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:28:54] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 04:28:54] [INFO ] Invariant cache hit.
[2023-03-08 04:28:54] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 04:28:54] [INFO ] Invariant cache hit.
[2023-03-08 04:28:54] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-08 04:28:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:28:54] [INFO ] Invariant cache hit.
[2023-03-08 04:28:54] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 04:28:55] [INFO ] Invariant cache hit.
[2023-03-08 04:28:55] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-08 04:28:55] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:28:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:28:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-08 04:28:55] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:28:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-08 04:28:55] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 04:28:55] [INFO ] Added : 14 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5467 reset in 260 ms.
Product exploration explored 100000 steps with 5515 reset in 282 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 04:28:56] [INFO ] Invariant cache hit.
[2023-03-08 04:28:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 04:28:56] [INFO ] Invariant cache hit.
[2023-03-08 04:28:56] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-08 04:28:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:28:56] [INFO ] Invariant cache hit.
[2023-03-08 04:28:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 4768 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)||((p2 U p0)&&p1))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 90 cols
[2023-03-08 04:28:56] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-08 04:28:56] [INFO ] Implicit Places using invariants in 85 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86, 87]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 93 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/90 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 80/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s34 1)), p2:(AND (GEQ s55 1) (GEQ s60 1)), p1:(AND (GEQ s7 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 347 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(p0)||X((p1&&G(p2))))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:28:57] [INFO ] Invariant cache hit.
[2023-03-08 04:28:57] [INFO ] Implicit Places using invariants in 143 ms returned [2, 12, 15, 55, 62, 79, 81, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 145 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 82/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s56 1) (GEQ s61 1)), p1:(OR (LT s12 1) (LT s79 1)), p2:(OR (LT s18 1) (LT s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2957 reset in 239 ms.
Product exploration explored 100000 steps with 2901 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 33 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 373 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:28:59] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-08 04:28:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:28:59] [INFO ] Invariant cache hit.
[2023-03-08 04:28:59] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 04:28:59] [INFO ] Invariant cache hit.
[2023-03-08 04:28:59] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 82/82 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 22 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 279 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 2964 reset in 256 ms.
Product exploration explored 100000 steps with 2918 reset in 274 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 19 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:29:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:29:02] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-08 04:29:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 82/82 places, 48/48 transitions.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:29:02] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 04:29:02] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 04:29:02] [INFO ] Invariant cache hit.
[2023-03-08 04:29:02] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 04:29:02] [INFO ] Invariant cache hit.
[2023-03-08 04:29:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 5799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(G(!p1))) U (p1||F(p2))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 86 transition count 43
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 10 place count 85 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 84 transition count 42
Applied a total of 12 rules in 12 ms. Remains 84 /90 variables (removed 6) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 84 cols
[2023-03-08 04:29:02] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 04:29:03] [INFO ] Implicit Places using invariants in 100 ms returned [2, 12, 21, 52, 58, 76, 81, 82]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/90 places, 42/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 76 transition count 36
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 70 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 69 transition count 35
Applied a total of 14 rules in 8 ms. Remains 69 /76 variables (removed 7) and now considering 35/42 (removed 7) transitions.
// Phase 1: matrix 35 rows 69 cols
[2023-03-08 04:29:03] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 04:29:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:29:03] [INFO ] Invariant cache hit.
[2023-03-08 04:29:03] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/90 places, 35/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 69/90 places, 35/48 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s55 1)), p2:(AND (GEQ s11 1) (GEQ s66 1)), p0:(AND (GEQ s0 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7898 reset in 289 ms.
Product exploration explored 100000 steps with 7850 reset in 319 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) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 595 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 28 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 794 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-08 04:29:05] [INFO ] Invariant cache hit.
[2023-03-08 04:29:05] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-08 04:29:05] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 04:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 04:29:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:29:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-08 04:29:06] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 04:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:06] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-08 04:29:06] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 04:29:06] [INFO ] Added : 16 causal constraints over 4 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-03-08 04:29:06] [INFO ] Invariant cache hit.
[2023-03-08 04:29:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 04:29:06] [INFO ] Invariant cache hit.
[2023-03-08 04:29:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-08 04:29:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:29:06] [INFO ] Invariant cache hit.
[2023-03-08 04:29:06] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 69/69 places, 35/35 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) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 606 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 26 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 876 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-08 04:29:08] [INFO ] Invariant cache hit.
[2023-03-08 04:29:08] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2023-03-08 04:29:08] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-08 04:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:08] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-08 04:29:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:29:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 04:29:08] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-08 04:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:08] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 04:29:08] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:29:08] [INFO ] Added : 16 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 7765 reset in 271 ms.
Product exploration explored 100000 steps with 7822 reset in 300 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-03-08 04:29:09] [INFO ] Invariant cache hit.
[2023-03-08 04:29:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 04:29:09] [INFO ] Invariant cache hit.
[2023-03-08 04:29:09] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 04:29:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:29:09] [INFO ] Invariant cache hit.
[2023-03-08 04:29:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 69/69 places, 35/35 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 6839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G((p1||F(p2)))))))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 90 cols
[2023-03-08 04:29:09] [INFO ] Computed 43 place invariants in 4 ms
[2023-03-08 04:29:09] [INFO ] Implicit Places using invariants in 140 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 141 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/90 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 81/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s78 1)), p1:(AND (GEQ s1 1) (GEQ s26 1)), p2:(AND (GEQ s55 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 150 steps with 4 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:29:10] [INFO ] Invariant cache hit.
[2023-03-08 04:29:10] [INFO ] Implicit Places using invariants in 95 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86, 87]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 97 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/90 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 80/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s13 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-09 finished in 242 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&&G(F(p1))))&&G(F(p2))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 86 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 84 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 82 transition count 40
Applied a total of 16 rules in 7 ms. Remains 82 /90 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 82 cols
[2023-03-08 04:29:10] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 04:29:10] [INFO ] Implicit Places using invariants in 89 ms returned [2, 15, 21, 52, 58, 73, 75, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 90 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/90 places, 40/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 74 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 71 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 71 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 69 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 68 transition count 34
Applied a total of 12 rules in 6 ms. Remains 68 /74 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 68 cols
[2023-03-08 04:29:10] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 04:29:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:29:10] [INFO ] Invariant cache hit.
[2023-03-08 04:29:10] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/90 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 68/90 places, 34/48 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s34 1)), p2:(OR (LT s56 1) (LT s66 1)), p0:(OR (LT s9 1) (LT s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 5487 reset in 249 ms.
Product exploration explored 100000 steps with 5554 reset in 266 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) p2 p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 466 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 488 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 135 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2023-03-08 04:29:12] [INFO ] Invariant cache hit.
[2023-03-08 04:29:12] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:12] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 04:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:12] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 04:29:12] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 04:29:13] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 04:29:13] [INFO ] Invariant cache hit.
[2023-03-08 04:29:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:29:13] [INFO ] Invariant cache hit.
[2023-03-08 04:29:13] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 04:29:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:29:13] [INFO ] Invariant cache hit.
[2023-03-08 04:29:13] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 68/68 places, 34/34 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), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 307 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 132 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 267 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 124 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2023-03-08 04:29:14] [INFO ] Invariant cache hit.
[2023-03-08 04:29:14] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 04:29:14] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 04:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:14] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:29:14] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:29:14] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5541 reset in 318 ms.
Product exploration explored 100000 steps with 5489 reset in 264 ms.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 04:29:15] [INFO ] Invariant cache hit.
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants in 108 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/68 places, 34/34 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 33
Applied a total of 2 rules in 2 ms. Remains 66 /67 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 66 cols
[2023-03-08 04:29:15] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:29:15] [INFO ] Invariant cache hit.
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/68 places, 33/34 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 66/68 places, 33/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 5134 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||G(p1))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 87 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 87 transition count 43
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 85 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 84 transition count 42
Applied a total of 12 rules in 7 ms. Remains 84 /90 variables (removed 6) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 84 cols
[2023-03-08 04:29:15] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants in 143 ms returned [2, 12, 15, 21, 53, 74, 76, 80, 81]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 145 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/90 places, 42/48 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 75 transition count 35
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 68 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 68 transition count 34
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 16 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 66 transition count 33
Applied a total of 18 rules in 5 ms. Remains 66 /75 variables (removed 9) and now considering 33/42 (removed 9) transitions.
// Phase 1: matrix 33 rows 66 cols
[2023-03-08 04:29:15] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 04:29:15] [INFO ] Invariant cache hit.
[2023-03-08 04:29:15] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/90 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 66/90 places, 33/48 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s56 1) (GEQ s60 1)), p0:(AND (GEQ s49 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7973 reset in 464 ms.
Product exploration explored 100000 steps with 7873 reset in 481 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) (NOT p0)), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-08 04:29:17] [INFO ] Invariant cache hit.
[2023-03-08 04:29:17] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-08 04:29:17] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 04:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:17] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:29:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:29:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 04:29:17] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:17] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:29:17] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:29:17] [INFO ] Added : 14 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:29:17] [INFO ] Invariant cache hit.
[2023-03-08 04:29:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 04:29:17] [INFO ] Invariant cache hit.
[2023-03-08 04:29:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-08 04:29:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:29:17] [INFO ] Invariant cache hit.
[2023-03-08 04:29:18] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 66/66 places, 33/33 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)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 414 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-08 04:29:18] [INFO ] Invariant cache hit.
[2023-03-08 04:29:18] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:18] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-08 04:29:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:29:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:19] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 04:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:19] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:29:19] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:29:19] [INFO ] Added : 14 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7873 reset in 331 ms.
Product exploration explored 100000 steps with 7835 reset in 521 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 04:29:20] [INFO ] Invariant cache hit.
[2023-03-08 04:29:20] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 04:29:20] [INFO ] Invariant cache hit.
[2023-03-08 04:29:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 04:29:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:29:20] [INFO ] Invariant cache hit.
[2023-03-08 04:29:20] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 4900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 86 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 84 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 82 transition count 40
Applied a total of 16 rules in 13 ms. Remains 82 /90 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 82 cols
[2023-03-08 04:29:20] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 04:29:20] [INFO ] Implicit Places using invariants in 160 ms returned [2, 12, 15, 21, 52, 58, 73, 75, 79, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 163 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/90 places, 40/48 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 72 transition count 34
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 66 transition count 32
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 64 transition count 32
Applied a total of 16 rules in 6 ms. Remains 64 /72 variables (removed 8) and now considering 32/40 (removed 8) transitions.
// Phase 1: matrix 32 rows 64 cols
[2023-03-08 04:29:20] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-08 04:29:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:29:20] [INFO ] Invariant cache hit.
[2023-03-08 04:29:20] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/90 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 64/90 places, 32/48 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5551 reset in 398 ms.
Product exploration explored 100000 steps with 5648 reset in 417 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 04:29:22] [INFO ] Invariant cache hit.
[2023-03-08 04:29:22] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:22] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:22] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 04:29:22] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 04:29:22] [INFO ] Added : 14 causal constraints over 3 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 04:29:22] [INFO ] Invariant cache hit.
[2023-03-08 04:29:22] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 04:29:22] [INFO ] Invariant cache hit.
[2023-03-08 04:29:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-08 04:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:29:22] [INFO ] Invariant cache hit.
[2023-03-08 04:29:22] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 04:29:23] [INFO ] Invariant cache hit.
[2023-03-08 04:29:23] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:23] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:23] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 04:29:23] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:29:23] [INFO ] Added : 14 causal constraints over 3 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5649 reset in 233 ms.
Product exploration explored 100000 steps with 5630 reset in 253 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 04:29:23] [INFO ] Invariant cache hit.
[2023-03-08 04:29:23] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 04:29:23] [INFO ] Invariant cache hit.
[2023-03-08 04:29:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-08 04:29:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:29:23] [INFO ] Invariant cache hit.
[2023-03-08 04:29:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 3628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((p1||X(p2))))&&p0)))'
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 90 cols
[2023-03-08 04:29:24] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-08 04:29:24] [INFO ] Implicit Places using invariants in 109 ms returned [2, 12, 15, 21, 55, 62, 79, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 111 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 82/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s74 1)), p1:(AND (GEQ s7 1) (GEQ s40 1)), p2:(OR (AND (GEQ s63 1) (GEQ s79 1)) (AND (GEQ s43 1) (GEQ s69 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][false, false, false]]
Product exploration explored 100000 steps with 5024 reset in 249 ms.
Product exploration explored 100000 steps with 5071 reset in 455 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), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 319 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:29:26] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 04:29:26] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 04:29:26] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 04:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:26] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 04:29:26] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 04:29:26] [INFO ] Added : 29 causal constraints over 6 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:29:26] [INFO ] Invariant cache hit.
[2023-03-08 04:29:26] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 04:29:26] [INFO ] Invariant cache hit.
[2023-03-08 04:29:26] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 04:29:26] [INFO ] Invariant cache hit.
[2023-03-08 04:29:26] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 82/82 places, 48/48 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) p2), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 465 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 04:29:28] [INFO ] Invariant cache hit.
[2023-03-08 04:29:28] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-08 04:29:28] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-08 04:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:28] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-08 04:29:28] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-08 04:29:28] [INFO ] Added : 29 causal constraints over 6 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4987 reset in 422 ms.
Product exploration explored 100000 steps with 5119 reset in 454 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 04:29:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:29:29] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-08 04:29:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 82/82 places, 48/48 transitions.
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 04:29:29] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 04:29:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 04:29:29] [INFO ] Invariant cache hit.
[2023-03-08 04:29:29] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-08 04:29:29] [INFO ] Invariant cache hit.
[2023-03-08 04:29:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-14 finished in 5807 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(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((F(p0)||X((p1&&G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(G(!p1))) U (p1||F(p2))))'
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&&G(F(p1))))&&G(F(p2))))'
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||G(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' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((p1||X(p2))))&&p0)))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-14
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 90/90 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 86 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 84 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 82 transition count 40
Applied a total of 16 rules in 8 ms. Remains 82 /90 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 82 cols
[2023-03-08 04:29:31] [INFO ] Computed 43 place invariants in 3 ms
[2023-03-08 04:29:31] [INFO ] Implicit Places using invariants in 102 ms returned [2, 12, 15, 21, 52, 58, 73, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 104 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/90 places, 40/48 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 74 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 72 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 72 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 70 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 68 transition count 34
Applied a total of 12 rules in 8 ms. Remains 68 /74 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 68 cols
[2023-03-08 04:29:31] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-08 04:29:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:29:31] [INFO ] Invariant cache hit.
[2023-03-08 04:29:31] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 68/90 places, 34/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 310 ms. Remains : 68/90 places, 34/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s64 1)), p1:(AND (GEQ s6 1) (GEQ s34 1)), p2:(OR (AND (GEQ s56 1) (GEQ s66 1)) (AND (GEQ s37 1) (GEQ s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5982 reset in 424 ms.
Product exploration explored 100000 steps with 6149 reset in 314 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), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
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 p0) (NOT p1) p2), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 372 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 04:29:33] [INFO ] Invariant cache hit.
[2023-03-08 04:29:33] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-08 04:29:33] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-08 04:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:33] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-08 04:29:33] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 04:29:33] [INFO ] Added : 15 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 04:29:33] [INFO ] Invariant cache hit.
[2023-03-08 04:29:33] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:29:33] [INFO ] Invariant cache hit.
[2023-03-08 04:29:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 04:29:33] [INFO ] Invariant cache hit.
[2023-03-08 04:29:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 68/68 places, 34/34 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) p2), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 04:29:34] [INFO ] Invariant cache hit.
[2023-03-08 04:29:34] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 04:29:34] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-08 04:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:29:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 04:29:34] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 04:29:34] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6042 reset in 245 ms.
Product exploration explored 100000 steps with 5950 reset in 270 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 04:29:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:29:35] [INFO ] Invariant cache hit.
[2023-03-08 04:29:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 68/68 places, 34/34 transitions.
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 04:29:35] [INFO ] Invariant cache hit.
[2023-03-08 04:29:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 04:29:35] [INFO ] Invariant cache hit.
[2023-03-08 04:29:36] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-08 04:29:36] [INFO ] Invariant cache hit.
[2023-03-08 04:29:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-14 finished in 5308 ms.
[2023-03-08 04:29:36] [INFO ] Flatten gal took : 13 ms
[2023-03-08 04:29:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 04:29:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 48 transitions and 180 arcs took 2 ms.
Total runtime 52972 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-048
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA CircularTrains-PT-048-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA CircularTrains-PT-048-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-048-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-048-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678249817441

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 28 (type EXCL) for 0 CircularTrains-PT-048-LTLFireability-01
lola: time limit : 400 sec
lola: memory limit: 32 pages
lola: FINISHED task # 28 (type EXCL) for CircularTrains-PT-048-LTLFireability-01
lola: result : false
lola: markings : 126
lola: fired transitions : 127
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-048-LTLFireability-04
lola: time limit : 450 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/450 10/32 CircularTrains-PT-048-LTLFireability-04 1506491 m, 301298 m/sec, 4762390 t fired, .

Time elapsed: 5 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/450 18/32 CircularTrains-PT-048-LTLFireability-04 2739121 m, 246526 m/sec, 9136879 t fired, .

Time elapsed: 10 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/450 27/32 CircularTrains-PT-048-LTLFireability-04 4076472 m, 267470 m/sec, 13724186 t fired, .

Time elapsed: 15 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 8
lola: CANCELED task # 7 (type EXCL) for CircularTrains-PT-048-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: LAUNCH task # 26 (type EXCL) for 25 CircularTrains-PT-048-LTLFireability-14
lola: time limit : 511 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 5/511 12/32 CircularTrains-PT-048-LTLFireability-14 1692825 m, 338565 m/sec, 4283401 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 10/511 23/32 CircularTrains-PT-048-LTLFireability-14 3418926 m, 345220 m/sec, 8984233 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 15/511 32/32 CircularTrains-PT-048-LTLFireability-14 4844615 m, 285137 m/sec, 13588782 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: CANCELED task # 26 (type EXCL) for CircularTrains-PT-048-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-048-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-048-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-10: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-048-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-13: F 0 1 0 0 1 0 0 0
CircularTrains-PT-048-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 8
lola: LAUNCH task # 29 (type EXCL) for 22 CircularTrains-PT-048-LTLFireability-13
lola: time limit : 593 sec
lola: memory limit: 32 pages
lola: FINISHED task # 29 (type EXCL) for CircularTrains-PT-048-LTLFireability-13
lola: result : false
lola: markings : 185
lola: fired transitions : 184
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 12 CircularTrains-PT-048-LTLFireability-10
lola: time limit : 712 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for CircularTrains-PT-048-LTLFireability-10
lola: result : true
lola: markings : 250
lola: fired transitions : 271
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 19 CircularTrains-PT-048-LTLFireability-11
lola: time limit : 890 sec
lola: memory limit: 32 pages
lola: FINISHED task # 20 (type EXCL) for CircularTrains-PT-048-LTLFireability-11
lola: result : true
lola: markings : 1003
lola: fired transitions : 1912
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 15 (type EXCL) for 12 CircularTrains-PT-048-LTLFireability-10
lola: time limit : 1186 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for CircularTrains-PT-048-LTLFireability-10
lola: result : true
lola: markings : 412
lola: fired transitions : 600
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-048-LTLFireability-02
lola: time limit : 1780 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-048-LTLFireability-02
lola: result : true
lola: markings : 5194
lola: fired transitions : 9533
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 CircularTrains-PT-048-LTLFireability-05
lola: time limit : 3560 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for CircularTrains-PT-048-LTLFireability-05
lola: result : true
lola: markings : 1975
lola: fired transitions : 3383
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 8

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-048-LTLFireability-01: F true state space / EG
CircularTrains-PT-048-LTLFireability-02: LTL true LTL model checker
CircularTrains-PT-048-LTLFireability-04: LTL unknown AGGR
CircularTrains-PT-048-LTLFireability-05: LTL true LTL model checker
CircularTrains-PT-048-LTLFireability-10: CONJ true CONJ
CircularTrains-PT-048-LTLFireability-11: LTL true LTL model checker
CircularTrains-PT-048-LTLFireability-13: F true state space / EG
CircularTrains-PT-048-LTLFireability-14: LTL unknown AGGR


Time elapsed: 40 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-048"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CircularTrains-PT-048, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397600164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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