Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-048
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 18:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:32:21] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 18:32:21] [INFO ] Transformed 96 places.
[2023-03-08 18:32:21] [INFO ] Transformed 48 transitions.
[2023-03-08 18:32:21] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 18 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 18:32:21] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-08 18:32:21] [INFO ] Implicit Places using invariants in 294 ms returned [1, 64, 84, 89, 92, 94]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 337 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 3 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 358 ms. Remains : 90/96 places, 48/48 transitions.
Support contains 44 out of 90 places after structural reductions.
[2023-03-08 18:32:22] [INFO ] Flatten gal took : 34 ms
[2023-03-08 18:32:22] [INFO ] Flatten gal took : 15 ms
[2023-03-08 18:32:22] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 90 cols
[2023-03-08 18:32:22] [INFO ] Computed 43 place invariants in 9 ms
[2023-03-08 18:32:22] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
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 18:32:23] [INFO ] Invariant cache hit.
[2023-03-08 18:32:23] [INFO ] Implicit Places using invariants in 210 ms returned [2, 12, 15, 21, 62, 79, 81, 86, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 212 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 223 ms. Remains : 81/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 299 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 449 ms.
Product exploration explored 100000 steps with 0 reset in 405 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 91 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 1551 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 1 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 18:32:24] [INFO ] Computed 43 place invariants in 3 ms
[2023-03-08 18:32:24] [INFO ] Implicit Places using invariants in 143 ms returned [2, 12, 15, 21, 53, 59, 74, 76, 80]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 144 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 1 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 18:32:24] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-08 18:32:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 18:32:24] [INFO ] Invariant cache hit.
[2023-03-08 18:32:25] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 234 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 418 ms. Remains : 66/90 places, 33/48 transitions.
Stuttering acceptance computed with spot in 37 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 10848 reset in 368 ms.
Product exploration explored 100000 steps with 10867 reset in 337 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 128 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 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 151 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)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 18:32:26] [INFO ] Invariant cache hit.
[2023-03-08 18:32:26] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 18:32:26] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:26] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 18:32:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-08 18:32:26] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:26] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-08 18:32:26] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 18:32:26] [INFO ] Added : 15 causal constraints over 3 iterations in 47 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 5 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 18:32:26] [INFO ] Invariant cache hit.
[2023-03-08 18:32:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 18:32:26] [INFO ] Invariant cache hit.
[2023-03-08 18:32:26] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 18:32:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:26] [INFO ] Invariant cache hit.
[2023-03-08 18:32:26] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 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 128 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 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 147 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)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-08 18:32:27] [INFO ] Invariant cache hit.
[2023-03-08 18:32:27] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-08 18:32:27] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:27] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 18:32:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:27] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 18:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:27] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 18:32:27] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 18:32:27] [INFO ] Added : 15 causal constraints over 3 iterations in 40 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 10875 reset in 276 ms.
Product exploration explored 100000 steps with 10782 reset in 284 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 4 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 18:32:28] [INFO ] Invariant cache hit.
[2023-03-08 18:32:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 18:32:28] [INFO ] Invariant cache hit.
[2023-03-08 18:32:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-08 18:32:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:28] [INFO ] Invariant cache hit.
[2023-03-08 18:32:28] [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 263 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 3743 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 1 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 9 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 18:32:28] [INFO ] Computed 43 place invariants in 3 ms
[2023-03-08 18:32:28] [INFO ] Implicit Places using invariants in 94 ms returned [2, 12, 15, 21, 52, 58, 73, 75, 79, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 95 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 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 18:32:28] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-08 18:32:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 18:32:28] [INFO ] Invariant cache hit.
[2023-03-08 18:32:28] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 172 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 283 ms. Remains : 64/90 places, 32/48 transitions.
Stuttering acceptance computed with spot in 76 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 5521 reset in 280 ms.
Product exploration explored 100000 steps with 5489 reset in 286 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 207 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
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 254 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 18:32:29] [INFO ] Invariant cache hit.
[2023-03-08 18:32:30] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:30] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:30] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 18:32:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:30] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:30] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 18:32:30] [INFO ] Added : 14 causal constraints over 3 iterations in 34 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 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 18:32:30] [INFO ] Invariant cache hit.
[2023-03-08 18:32:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 18:32:30] [INFO ] Invariant cache hit.
[2023-03-08 18:32:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 18:32:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:30] [INFO ] Invariant cache hit.
[2023-03-08 18:32:30] [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 244 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 211 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
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 252 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 18:32:31] [INFO ] Invariant cache hit.
[2023-03-08 18:32:31] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-08 18:32:31] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 18:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:31] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 18:32:31] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:31] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 18:32:31] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:31] [INFO ] Added : 14 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5610 reset in 263 ms.
Product exploration explored 100000 steps with 5450 reset in 286 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 18:32:32] [INFO ] Invariant cache hit.
[2023-03-08 18:32:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 18:32:32] [INFO ] Invariant cache hit.
[2023-03-08 18:32:32] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-08 18:32:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:32:32] [INFO ] Invariant cache hit.
[2023-03-08 18:32:32] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 3935 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 2 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 18:32:32] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:32] [INFO ] Implicit Places using invariants in 94 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86, 87]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 100 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 104 ms. Remains : 80/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 254 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 2 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 378 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 18:32:32] [INFO ] Invariant cache hit.
[2023-03-08 18:32:32] [INFO ] Implicit Places using invariants in 88 ms returned [2, 12, 15, 55, 62, 79, 81, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 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 90 ms. Remains : 82/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 194 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 2929 reset in 240 ms.
Product exploration explored 100000 steps with 2956 reset in 270 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 186 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 194 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 36 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=18 )
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 287 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 194 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 190 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 1 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 18:32:34] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 18:32:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 18:32:34] [INFO ] Invariant cache hit.
[2023-03-08 18:32:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 18:32:34] [INFO ] Invariant cache hit.
[2023-03-08 18:32:34] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 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 145 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 204 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 35 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=17 )
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 260 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 196 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 189 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 189 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 2946 reset in 248 ms.
Product exploration explored 100000 steps with 2995 reset in 270 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 194 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 15 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 18:32:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 18:32:36] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-08 18:32:37] [INFO ] Dead Transitions using invariants and state equation in 72 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 94 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 18:32:37] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-08 18:32:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 18:32:37] [INFO ] Invariant cache hit.
[2023-03-08 18:32:37] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 18:32:37] [INFO ] Invariant cache hit.
[2023-03-08 18:32:37] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 4670 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 10 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 18:32:37] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:37] [INFO ] Implicit Places using invariants in 89 ms returned [2, 12, 21, 52, 58, 76, 81, 82]
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 : 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 0 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 9 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 18:32:37] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 18:32:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 18:32:37] [INFO ] Invariant cache hit.
[2023-03-08 18:32:37] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 174 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 286 ms. Remains : 69/90 places, 35/48 transitions.
Stuttering acceptance computed with spot in 214 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 7692 reset in 283 ms.
Product exploration explored 100000 steps with 7719 reset in 312 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 580 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 115 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 54 steps, including 0 resets, run visited all 6 properties in 19 ms. (steps per millisecond=2 )
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 710 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 114 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-08 18:32:40] [INFO ] Invariant cache hit.
[2023-03-08 18:32:40] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-08 18:32:40] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:40] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:32:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:40] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-08 18:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:40] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:32:40] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:40] [INFO ] Added : 16 causal constraints over 4 iterations in 38 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 18:32:40] [INFO ] Invariant cache hit.
[2023-03-08 18:32:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 18:32:40] [INFO ] Invariant cache hit.
[2023-03-08 18:32:40] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 18:32:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:32:40] [INFO ] Invariant cache hit.
[2023-03-08 18:32:40] [INFO ] Dead Transitions using invariants and state equation in 51 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 570 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 114 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 105 steps, including 0 resets, run visited all 6 properties in 8 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 698 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 113 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-08 18:32:42] [INFO ] Invariant cache hit.
[2023-03-08 18:32:42] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:42] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:42] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 18:32:42] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 18:32:42] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 7667 reset in 272 ms.
Product exploration explored 100000 steps with 7805 reset in 303 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 18:32:43] [INFO ] Invariant cache hit.
[2023-03-08 18:32:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 18:32:43] [INFO ] Invariant cache hit.
[2023-03-08 18:32:43] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-08 18:32:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:32:43] [INFO ] Invariant cache hit.
[2023-03-08 18:32:43] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 69/69 places, 35/35 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 6135 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 18:32:43] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:43] [INFO ] Implicit Places using invariants in 83 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 85 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 90 ms. Remains : 81/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 179 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 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 292 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 18:32:43] [INFO ] Invariant cache hit.
[2023-03-08 18:32:43] [INFO ] Implicit Places using invariants in 103 ms returned [2, 12, 15, 21, 55, 62, 79, 81, 86, 87]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 105 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 108 ms. Remains : 80/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 116 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 238 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 9 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 18:32:44] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:44] [INFO ] Implicit Places using invariants in 101 ms returned [2, 15, 21, 52, 58, 73, 75, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 103 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 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 18:32:44] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 18:32:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 18:32:44] [INFO ] Invariant cache hit.
[2023-03-08 18:32:44] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 163 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 284 ms. Remains : 68/90 places, 34/48 transitions.
Stuttering acceptance computed with spot in 198 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 5500 reset in 243 ms.
Product exploration explored 100000 steps with 5549 reset in 270 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 357 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 111 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
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 388 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 106 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2023-03-08 18:32:46] [INFO ] Invariant cache hit.
[2023-03-08 18:32:46] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:46] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 18:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:46] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:32:46] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 18:32:46] [INFO ] Added : 16 causal constraints over 4 iterations in 42 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 2 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 18:32:46] [INFO ] Invariant cache hit.
[2023-03-08 18:32:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 18:32:46] [INFO ] Invariant cache hit.
[2023-03-08 18:32:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 18:32:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:46] [INFO ] Invariant cache hit.
[2023-03-08 18:32:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 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 209 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 108 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
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 258 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 108 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2023-03-08 18:32:47] [INFO ] Invariant cache hit.
[2023-03-08 18:32:47] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:47] [INFO ] [Real]Absence check using 31 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 18:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:47] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 18:32:47] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 18:32:47] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5554 reset in 247 ms.
Product exploration explored 100000 steps with 5580 reset in 268 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 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 18:32:48] [INFO ] Invariant cache hit.
[2023-03-08 18:32:48] [INFO ] Implicit Places using invariants in 91 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 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 4 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 18:32:48] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 18:32:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 18:32:48] [INFO ] Invariant cache hit.
[2023-03-08 18:32:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 162 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 260 ms. Remains : 66/68 places, 33/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 4407 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 0 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 6 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 18:32:48] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:48] [INFO ] Implicit Places using invariants in 97 ms returned [2, 12, 15, 21, 53, 74, 76, 80, 81]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 98 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 6 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 18:32:48] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-08 18:32:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 18:32:48] [INFO ] Invariant cache hit.
[2023-03-08 18:32:48] [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.
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 273 ms. Remains : 66/90 places, 33/48 transitions.
Stuttering acceptance computed with spot in 35 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 7894 reset in 274 ms.
Product exploration explored 100000 steps with 7971 reset in 297 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 203 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 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
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 243 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 35 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-08 18:32:49] [INFO ] Invariant cache hit.
[2023-03-08 18:32:49] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:49] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 18:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:49] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:32:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:50] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 18:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:50] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:50] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:50] [INFO ] Added : 14 causal constraints over 3 iterations in 32 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 2 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 18:32:50] [INFO ] Invariant cache hit.
[2023-03-08 18:32:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 18:32:50] [INFO ] Invariant cache hit.
[2023-03-08 18:32:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 18:32:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:50] [INFO ] Invariant cache hit.
[2023-03-08 18:32:50] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 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 207 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 22 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=7 )
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 254 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 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-08 18:32:50] [INFO ] Invariant cache hit.
[2023-03-08 18:32:51] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-08 18:32:51] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 18:32:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:32:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-08 18:32:51] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:51] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:51] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:51] [INFO ] Added : 14 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7923 reset in 284 ms.
Product exploration explored 100000 steps with 7913 reset in 313 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 2 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-08 18:32:51] [INFO ] Invariant cache hit.
[2023-03-08 18:32:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 18:32:51] [INFO ] Invariant cache hit.
[2023-03-08 18:32:52] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 18:32:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:52] [INFO ] Invariant cache hit.
[2023-03-08 18:32:52] [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 233 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 3689 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 6 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 18:32:52] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:52] [INFO ] Implicit Places using invariants in 97 ms returned [2, 12, 15, 21, 52, 58, 73, 75, 79, 80]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 98 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 0 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 4 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 18:32:52] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-08 18:32:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 18:32:52] [INFO ] Invariant cache hit.
[2023-03-08 18:32:52] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 162 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 271 ms. Remains : 64/90 places, 32/48 transitions.
Stuttering acceptance computed with spot in 35 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 5690 reset in 239 ms.
Product exploration explored 100000 steps with 5612 reset in 270 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 117 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 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 138 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)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-08 18:32:53] [INFO ] Invariant cache hit.
[2023-03-08 18:32:53] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:53] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 18:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:53] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-08 18:32:53] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 18:32:53] [INFO ] Added : 14 causal constraints over 3 iterations in 31 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 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-08 18:32:53] [INFO ] Invariant cache hit.
[2023-03-08 18:32:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 18:32:53] [INFO ] Invariant cache hit.
[2023-03-08 18:32:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-08 18:32:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:32:53] [INFO ] Invariant cache hit.
[2023-03-08 18:32:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 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 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 35 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 2 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 135 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-08 18:32:54] [INFO ] Invariant cache hit.
[2023-03-08 18:32:54] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-08 18:32:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 18:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:54] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 18:32:54] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:54] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5645 reset in 233 ms.
Product exploration explored 100000 steps with 5640 reset in 260 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 18:32:54] [INFO ] Invariant cache hit.
[2023-03-08 18:32:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 18:32:54] [INFO ] Invariant cache hit.
[2023-03-08 18:32:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-08 18:32:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:32:54] [INFO ] Invariant cache hit.
[2023-03-08 18:32:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 2860 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 18:32:54] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:32:55] [INFO ] Implicit Places using invariants in 82 ms returned [2, 12, 15, 21, 55, 62, 79, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 83 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 84 ms. Remains : 82/90 places, 48/48 transitions.
Stuttering acceptance computed with spot in 114 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 5019 reset in 240 ms.
Product exploration explored 100000 steps with 4967 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) (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 257 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 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
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 322 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))]
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))]
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 18:32:56] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-08 18:32:56] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-08 18:32:56] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 18:32:56] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 18:32:56] [INFO ] Added : 29 causal constraints over 6 iterations in 63 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 18:32:56] [INFO ] Invariant cache hit.
[2023-03-08 18:32:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 18:32:56] [INFO ] Invariant cache hit.
[2023-03-08 18:32:56] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 18:32:56] [INFO ] Invariant cache hit.
[2023-03-08 18:32:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 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 254 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 40 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=20 )
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 320 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 109 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 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 18:32:57] [INFO ] Invariant cache hit.
[2023-03-08 18:32:57] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 18:32:58] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:32:58] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-08 18:32:58] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:32:58] [INFO ] Added : 29 causal constraints over 6 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
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))]
Product exploration explored 100000 steps with 5014 reset in 241 ms.
Product exploration explored 100000 steps with 4961 reset in 268 ms.
Applying partial POR strategy [false, false, true]
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))]
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 1 ms
Applied a total of 14 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-08 18:32:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2023-03-08 18:32:58] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 18:32:59] [INFO ] Dead Transitions using invariants and state equation in 58 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 72 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 1 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 18:32:59] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-08 18:32:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 18:32:59] [INFO ] Invariant cache hit.
[2023-03-08 18:32:59] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 18:32:59] [INFO ] Invariant cache hit.
[2023-03-08 18:32:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-14 finished in 4328 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 110 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 6 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 18:33:00] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 18:33:00] [INFO ] Implicit Places using invariants in 87 ms returned [2, 12, 15, 21, 52, 58, 73, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 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 4 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 18:33:00] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 18:33:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 18:33:00] [INFO ] Invariant cache hit.
[2023-03-08 18:33:00] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 162 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 262 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 5989 reset in 254 ms.
Product exploration explored 100000 steps with 6066 reset in 281 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 257 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 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT 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 325 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 110 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 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 18:33:01] [INFO ] Invariant cache hit.
[2023-03-08 18:33:01] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-08 18:33:01] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:33:02] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:33:02] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 18:33:02] [INFO ] Added : 15 causal constraints over 3 iterations in 35 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 18:33:02] [INFO ] Invariant cache hit.
[2023-03-08 18:33:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 18:33:02] [INFO ] Invariant cache hit.
[2023-03-08 18:33:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 18:33:02] [INFO ] Invariant cache hit.
[2023-03-08 18:33:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 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 261 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 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
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 388 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))]
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))]
[2023-03-08 18:33:03] [INFO ] Invariant cache hit.
[2023-03-08 18:33:03] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-08 18:33:03] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-08 18:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:33:03] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 18:33:03] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 18:33:03] [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 112 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 6101 reset in 249 ms.
Product exploration explored 100000 steps with 6023 reset in 274 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 109 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 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 18:33:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:33:04] [INFO ] Invariant cache hit.
[2023-03-08 18:33:04] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 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 0 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2023-03-08 18:33:04] [INFO ] Invariant cache hit.
[2023-03-08 18:33:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 18:33:04] [INFO ] Invariant cache hit.
[2023-03-08 18:33:04] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 18:33:04] [INFO ] Invariant cache hit.
[2023-03-08 18:33:04] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-14 finished in 4583 ms.
[2023-03-08 18:33:04] [INFO ] Flatten gal took : 8 ms
[2023-03-08 18:33:04] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 18:33:04] [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 43323 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2689/ltl_7_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-01
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-02
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-04
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-05
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-11
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-13
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-14

BK_STOP 1678300386146

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CircularTrains-PT-048-LTLFireability-01
ltl formula formula --ltl=/tmp/2689/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 90 places, 48 transitions and 180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2689/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2689/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2689/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2689/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f566a893f4]
1: pnml2lts-mc(+0xa2496) [0x55f566a89496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fccd1a19140]
3: pnml2lts-mc(+0x405be5) [0x55f566decbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55f566b523f9]
5: pnml2lts-mc(+0x164ac4) [0x55f566b4bac4]
6: pnml2lts-mc(+0x272e0a) [0x55f566c59e0a]
7: pnml2lts-mc(+0xb61f0) [0x55f566a9d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fccd186c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fccd186c67a]
10: pnml2lts-mc(+0xa1581) [0x55f566a88581]
11: pnml2lts-mc(+0xa1910) [0x55f566a88910]
12: pnml2lts-mc(+0xa32a2) [0x55f566a8a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55f566a8c0f4]
14: pnml2lts-mc(+0xa516b) [0x55f566a8c16b]
15: pnml2lts-mc(+0x3f34b3) [0x55f566dda4b3]
16: pnml2lts-mc(+0x7c63d) [0x55f566a6363d]
17: pnml2lts-mc(+0x67d86) [0x55f566a4ed86]
18: pnml2lts-mc(+0x60a8a) [0x55f566a47a8a]
19: pnml2lts-mc(+0x5eb15) [0x55f566a45b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fccd1854d0a]
21: pnml2lts-mc(+0x6075e) [0x55f566a4775e]
ltl formula name CircularTrains-PT-048-LTLFireability-02
ltl formula formula --ltl=/tmp/2689/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 90 places, 48 transitions and 180 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2689/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2689/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2689/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2689/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557dd9b9f3f4]
1: pnml2lts-mc(+0xa2496) [0x557dd9b9f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f98cf121140]
3: pnml2lts-mc(+0x405be5) [0x557dd9f02be5]
4: pnml2lts-mc(+0x16b3f9) [0x557dd9c683f9]
5: pnml2lts-mc(+0x164ac4) [0x557dd9c61ac4]
6: pnml2lts-mc(+0x272e0a) [0x557dd9d6fe0a]
7: pnml2lts-mc(+0xb61f0) [0x557dd9bb31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f98cef744d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f98cef7467a]
10: pnml2lts-mc(+0xa1581) [0x557dd9b9e581]
11: pnml2lts-mc(+0xa1910) [0x557dd9b9e910]
12: pnml2lts-mc(+0xa32a2) [0x557dd9ba02a2]
13: pnml2lts-mc(+0xa50f4) [0x557dd9ba20f4]
14: pnml2lts-mc(+0xa516b) [0x557dd9ba216b]
15: pnml2lts-mc(+0x3f34b3) [0x557dd9ef04b3]
16: pnml2lts-mc(+0x7c63d) [0x557dd9b7963d]
17: pnml2lts-mc(+0x67d86) [0x557dd9b64d86]
18: pnml2lts-mc(+0x60a8a) [0x557dd9b5da8a]
19: pnml2lts-mc(+0x5eb15) [0x557dd9b5bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f98cef5cd0a]
21: pnml2lts-mc(+0x6075e) [0x557dd9b5d75e]
ltl formula name CircularTrains-PT-048-LTLFireability-04
ltl formula formula --ltl=/tmp/2689/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 90 places, 48 transitions and 180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2689/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2689/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2689/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2689/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CircularTrains-PT-048-LTLFireability-05
ltl formula formula --ltl=/tmp/2689/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 90 places, 48 transitions and 180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2689/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2689/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2689/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2689/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CircularTrains-PT-048-LTLFireability-10
ltl formula formula --ltl=/tmp/2689/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 90 places, 48 transitions and 180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2689/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2689/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2689/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2689/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-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 r073-smll-167814399200164"
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 ;