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.r233-tall-167856418700324.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 Kanban-PT-20000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-20000-LTLFireability-00
FORMULA_NAME Kanban-PT-20000-LTLFireability-01
FORMULA_NAME Kanban-PT-20000-LTLFireability-02
FORMULA_NAME Kanban-PT-20000-LTLFireability-03
FORMULA_NAME Kanban-PT-20000-LTLFireability-04
FORMULA_NAME Kanban-PT-20000-LTLFireability-05
FORMULA_NAME Kanban-PT-20000-LTLFireability-06
FORMULA_NAME Kanban-PT-20000-LTLFireability-07
FORMULA_NAME Kanban-PT-20000-LTLFireability-08
FORMULA_NAME Kanban-PT-20000-LTLFireability-09
FORMULA_NAME Kanban-PT-20000-LTLFireability-10
FORMULA_NAME Kanban-PT-20000-LTLFireability-11
FORMULA_NAME Kanban-PT-20000-LTLFireability-12
FORMULA_NAME Kanban-PT-20000-LTLFireability-13
FORMULA_NAME Kanban-PT-20000-LTLFireability-14
FORMULA_NAME Kanban-PT-20000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679500200980

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=Kanban-PT-20000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 15:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:50:02] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-22 15:50:02] [INFO ] Transformed 16 places.
[2023-03-22 15:50:02] [INFO ] Transformed 16 transitions.
[2023-03-22 15:50:02] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-20000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 15:50:03] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 15:50:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-22 15:50:03] [INFO ] Invariant cache hit.
[2023-03-22 15:50:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-22 15:50:03] [INFO ] Invariant cache hit.
[2023-03-22 15:50:03] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 13 out of 16 places after structural reductions.
[2023-03-22 15:50:03] [INFO ] Flatten gal took : 15 ms
[2023-03-22 15:50:03] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:50:03] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=1250 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:50:03] [INFO ] Invariant cache hit.
[2023-03-22 15:50:03] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-22 15:50:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 15:50:03] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:50:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 15:50:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 15:50:03] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:50:03] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 15:50:03] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 39832 steps, including 0 resets, run visited all 1 properties in 102 ms. (steps per millisecond=390 )
Parikh walk visited 1 properties in 102 ms.
FORMULA Kanban-PT-20000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Kanban-PT-20000-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 15:50:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 15:50:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 15:50:04] [INFO ] Invariant cache hit.
[2023-03-22 15:50:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 15:50:04] [INFO ] Invariant cache hit.
[2023-03-22 15:50:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-01 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:(GEQ s0 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 2 ms.
FORMULA Kanban-PT-20000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-01 finished in 454 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((X(p0) U p1))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 15:50:04] [INFO ] Invariant cache hit.
[2023-03-22 15:50:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 15:50:04] [INFO ] Invariant cache hit.
[2023-03-22 15:50:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 15:50:04] [INFO ] Invariant cache hit.
[2023-03-22 15:50:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s9 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][false, false]]
Product exploration explored 100000 steps with 2194 reset in 294 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-02 finished in 484 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(X(p1))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 15:50:05] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 15:50:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 15:50:05] [INFO ] Invariant cache hit.
[2023-03-22 15:50:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-22 15:50:05] [INFO ] Invariant cache hit.
[2023-03-22 15:50:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s11 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10830 reset in 127 ms.
Stack based approach found an accepted trace after 108 steps with 12 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-03 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X(X(F(!p0))))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 15:50:05] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 15:50:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 15:50:05] [INFO ] Invariant cache hit.
[2023-03-22 15:50:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 15:50:05] [INFO ] Invariant cache hit.
[2023-03-22 15:50:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s6 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 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 109 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-20000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-20000-LTLFireability-04 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 15:50:06] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 15:50:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 15:50:06] [INFO ] Invariant cache hit.
[2023-03-22 15:50:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 15:50:06] [INFO ] Invariant cache hit.
[2023-03-22 15:50:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1855 reset in 114 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-05 finished in 358 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 U X(p1))&&G(F(p0))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 15:50:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 15:50:06] [INFO ] Invariant cache hit.
[2023-03-22 15:50:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 15:50:06] [INFO ] Invariant cache hit.
[2023-03-22 15:50:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4146 reset in 88 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-06 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(p1)) U G(p1)))'
Support contains 1 out of 16 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 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
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 5 place count 11 transition count 12
Applied a total of 5 rules in 3252 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 15:50:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 15:50:10] [INFO ] Invariant cache hit.
[2023-03-22 15:50:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-22 15:50:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 15:50:10] [INFO ] Invariant cache hit.
[2023-03-22 15:50:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3367 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-07 finished in 3439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(X(!p0)&&F(!p1))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 4 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 15:50:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 15:50:10] [INFO ] Invariant cache hit.
[2023-03-22 15:50:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 15:50:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:10] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 15:50:10] [INFO ] Invariant cache hit.
[2023-03-22 15:50:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-08 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((p1||G(p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 13
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 5 place count 12 transition count 12
Applied a total of 5 rules in 3415 ms. Remains 12 /16 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 15:50:14] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 12 cols
[2023-03-22 15:50:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 15:50:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 15:50:14] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 15:50:14] [INFO ] Invariant cache hit.
[2023-03-22 15:50:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-22 15:50:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:14] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 15:50:14] [INFO ] Invariant cache hit.
[2023-03-22 15:50:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3517 ms. Remains : 12/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s4 1), p2:(GEQ s6 1), p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 47 steps with 13 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-09 finished in 3774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 5 place count 10 transition count 11
Applied a total of 5 rules in 3198 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2023-03-22 15:50:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 15:50:17] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 15:50:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 15:50:17] [INFO ] Invariant cache hit.
[2023-03-22 15:50:17] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 15:50:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 15:50:17] [INFO ] Invariant cache hit.
[2023-03-22 15:50:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3296 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-11 finished in 3358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||G(p1))) U p2))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 15:50:17] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 15:50:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 15:50:17] [INFO ] Invariant cache hit.
[2023-03-22 15:50:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 15:50:17] [INFO ] Invariant cache hit.
[2023-03-22 15:50:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s3 1) (GEQ s4 1)), p1:(GEQ s3 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30048 reset in 96 ms.
Product exploration explored 100000 steps with 30029 reset in 85 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 p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 814 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), false, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=2222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:50:19] [INFO ] Invariant cache hit.
[2023-03-22 15:50:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 15:50:19] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 15:50:19] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 15:50:19] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 139991 steps, including 0 resets, run visited all 1 properties in 244 ms. (steps per millisecond=573 )
Parikh walk visited 1 properties in 243 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 820 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, false, false, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[true, false, false, (NOT p1)]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 15:50:20] [INFO ] Invariant cache hit.
[2023-03-22 15:50:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 15:50:20] [INFO ] Invariant cache hit.
[2023-03-22 15:50:20] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 15:50:20] [INFO ] Invariant cache hit.
[2023-03-22 15:50:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 15/15 places, 16/16 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 p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 265 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=2222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 906124 steps, run visited all 1 properties in 1040 ms. (steps per millisecond=871 )
Probabilistic random walk after 906124 steps, saw 703821 distinct states, run finished after 1042 ms. (steps per millisecond=869 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 7 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 15:50:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:23] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 11 cols
[2023-03-22 15:50:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 11/15 places, 12/16 transitions.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 15:50:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 15:50:23] [INFO ] Invariant cache hit.
[2023-03-22 15:50:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-22 15:50:23] [INFO ] Invariant cache hit.
[2023-03-22 15:50:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 15/15 places, 16/16 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-12 finished in 5732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X(X(p1)) U (p2 U X(X(G(p3))))))))'
Support contains 2 out of 16 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 : 16/16 places, 16/16 transitions.
Graph (trivial) has 3 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 13 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2023-03-22 15:50:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 15:50:23] [INFO ] Invariant cache hit.
[2023-03-22 15:50:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 15:50:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:23] [INFO ] Invariant cache hit.
[2023-03-22 15:50:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/16 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1), p3:(GEQ s7 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 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 70 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 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 4 factoid took 190 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 33 ms :[(AND (NOT p0) (NOT p3))]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=2222 ) properties (out of 2) seen :1
Finished Best-First random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 208 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 33 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-22 15:50:24] [INFO ] Invariant cache hit.
[2023-03-22 15:50:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 15:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:50:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 15:50:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 15:50:24] [INFO ] Computed and/alt/rep : 13/18/13 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 15:50:24] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 2 out of 13 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 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 15:50:24] [INFO ] Invariant cache hit.
[2023-03-22 15:50:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 15:50:24] [INFO ] Invariant cache hit.
[2023-03-22 15:50:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 15:50:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:24] [INFO ] Invariant cache hit.
[2023-03-22 15:50:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 13/13 places, 14/14 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 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 4 factoid took 208 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 33 ms :[(AND (NOT p0) (NOT p3))]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 2) seen :1
Finished Best-First random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 225 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 106 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-22 15:50:25] [INFO ] Invariant cache hit.
[2023-03-22 15:50:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 15:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:50:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 15:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:25] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 15:50:25] [INFO ] Computed and/alt/rep : 13/18/13 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 15:50:25] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Graph (trivial) has 7 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 7 ms. Remains 11 /13 variables (removed 2) and now considering 12/14 (removed 2) transitions.
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 15:50:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 15:50:25] [INFO ] Invariant cache hit.
[2023-03-22 15:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 15:50:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 15:50:25] [INFO ] Invariant cache hit.
[2023-03-22 15:50:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/13 places, 12/14 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 11/13 places, 12/14 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-14 finished in 1948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||G(p1))) U p2))'
Found a Lengthening insensitive property : Kanban-PT-20000-LTLFireability-12
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 4 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 15:50:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 15:50:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:25] [INFO ] Invariant cache hit.
[2023-03-22 15:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 15:50:25] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:25] [INFO ] Invariant cache hit.
[2023-03-22 15:50:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 86 ms. Remains : 12/16 places, 13/16 transitions.
Running random walk in product with property : Kanban-PT-20000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s2 1) (GEQ s3 1)), p1:(GEQ s2 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30185 reset in 91 ms.
Product exploration explored 100000 steps with 29874 reset in 84 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 p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 874 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), false, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=6667 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:50:27] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:27] [INFO ] Invariant cache hit.
[2023-03-22 15:50:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 15:50:27] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 15:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:27] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:50:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:50:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 15:50:27] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:50:27] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:50:27] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 15:50:27] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20000 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=1428 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 854 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, false, false, (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[true, false, false, (NOT p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 15:50:28] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:28] [INFO ] Invariant cache hit.
[2023-03-22 15:50:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 15:50:28] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:28] [INFO ] Invariant cache hit.
[2023-03-22 15:50:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-22 15:50:28] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:28] [INFO ] Invariant cache hit.
[2023-03-22 15:50:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 13/13 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 p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=5000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 778025 steps, run visited all 1 properties in 715 ms. (steps per millisecond=1088 )
Probabilistic random walk after 778025 steps, saw 449756 distinct states, run finished after 715 ms. (steps per millisecond=1088 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 460 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 11/13 (removed 2) transitions.
[2023-03-22 15:50:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:50:30] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 15:50:30] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 15:50:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 11/13 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 10/12 places, 11/13 transitions.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 15:50:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 15:50:30] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 15:50:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 15:50:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:30] [INFO ] Invariant cache hit.
[2023-03-22 15:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:50:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 15:50:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 15:50:30] [INFO ] Invariant cache hit.
[2023-03-22 15:50:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 12/12 places, 13/13 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-12 finished in 5512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X(X(p1)) U (p2 U X(X(G(p3))))))))'
[2023-03-22 15:50:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 15:50:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 15:50:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 1 ms.
Total runtime 28499 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1594/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1594/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Kanban-PT-20000-LTLFireability-12
Could not compute solution for formula : Kanban-PT-20000-LTLFireability-14

BK_STOP 1679500232295

--------------------
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 Kanban-PT-20000-LTLFireability-12
ltl formula formula --ltl=/tmp/1594/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 16 places, 16 transitions and 40 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( 0/ 4): LTL layer: formula: /tmp/1594/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1594/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1594/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1594/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55a5cc7033f4]
1: pnml2lts-mc(+0xa2496) [0x55a5cc703496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f6338fd9140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x84038) [0x7f6338e75038]
4: pnml2lts-mc(+0x16b416) [0x55a5cc7cc416]
5: pnml2lts-mc(+0x164ac4) [0x55a5cc7c5ac4]
6: pnml2lts-mc(+0x272e0a) [0x55a5cc8d3e0a]
7: pnml2lts-mc(+0xb61f0) [0x55a5cc7171f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6338e2c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6338e2c67a]
10: pnml2lts-mc(+0xa1581) [0x55a5cc702581]
11: pnml2lts-mc(+0xa1910) [0x55a5cc702910]
12: pnml2lts-mc(+0xa32a2) [0x55a5cc7042a2]
13: pnml2lts-mc(+0xa50f4) [0x55a5cc7060f4]
14: pnml2lts-mc(+0x3f34b3) [0x55a5cca544b3]
15: pnml2lts-mc(+0x7c63d) [0x55a5cc6dd63d]
16: pnml2lts-mc(+0x67d86) [0x55a5cc6c8d86]
17: pnml2lts-mc(+0x60a8a) [0x55a5cc6c1a8a]
18: pnml2lts-mc(+0x5eb15) [0x55a5cc6bfb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6338e14d0a]
20: pnml2lts-mc(+0x6075e) [0x55a5cc6c175e]
ltl formula name Kanban-PT-20000-LTLFireability-14
ltl formula formula --ltl=/tmp/1594/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 16 places, 16 transitions and 40 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1594/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1594/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1594/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1594/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 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) [0x55c76e8d23f4]
1: pnml2lts-mc(+0xa2496) [0x55c76e8d2496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fab747da140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x84038) [0x7fab74676038]
4: pnml2lts-mc(+0x16b416) [0x55c76e99b416]
5: pnml2lts-mc(+0x164ac4) [0x55c76e994ac4]
6: pnml2lts-mc(+0x272e0a) [0x55c76eaa2e0a]
7: pnml2lts-mc(+0xb61f0) [0x55c76e8e61f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fab7462d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fab7462d67a]
10: pnml2lts-mc(+0xa1581) [0x55c76e8d1581]
11: pnml2lts-mc(+0xa1910) [0x55c76e8d1910]
12: pnml2lts-mc(+0xa32a2) [0x55c76e8d32a2]
13: pnml2lts-mc(+0xa50f4) [0x55c76e8d50f4]
14: pnml2lts-mc(+0xa516b) [0x55c76e8d516b]
15: pnml2lts-mc(+0x3f34b3) [0x55c76ec234b3]
16: pnml2lts-mc(+0x7c63d) [0x55c76e8ac63d]
17: pnml2lts-mc(+0x67d86) [0x55c76e897d86]
18: pnml2lts-mc(+0x60a8a) [0x55c76e890a8a]
19: pnml2lts-mc(+0x5eb15) [0x55c76e88eb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fab74615d0a]
21: pnml2lts-mc(+0x6075e) [0x55c76e89075e]

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="Kanban-PT-20000"
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 Kanban-PT-20000, 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 r233-tall-167856418700324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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