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.r489-tall-167912706900548.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 TCPcondis-PT-35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706900548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.9K Feb 26 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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 TCPcondis-PT-35-LTLFireability-00
FORMULA_NAME TCPcondis-PT-35-LTLFireability-01
FORMULA_NAME TCPcondis-PT-35-LTLFireability-02
FORMULA_NAME TCPcondis-PT-35-LTLFireability-03
FORMULA_NAME TCPcondis-PT-35-LTLFireability-04
FORMULA_NAME TCPcondis-PT-35-LTLFireability-05
FORMULA_NAME TCPcondis-PT-35-LTLFireability-06
FORMULA_NAME TCPcondis-PT-35-LTLFireability-07
FORMULA_NAME TCPcondis-PT-35-LTLFireability-08
FORMULA_NAME TCPcondis-PT-35-LTLFireability-09
FORMULA_NAME TCPcondis-PT-35-LTLFireability-10
FORMULA_NAME TCPcondis-PT-35-LTLFireability-11
FORMULA_NAME TCPcondis-PT-35-LTLFireability-12
FORMULA_NAME TCPcondis-PT-35-LTLFireability-13
FORMULA_NAME TCPcondis-PT-35-LTLFireability-14
FORMULA_NAME TCPcondis-PT-35-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679277123941

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=TCPcondis-PT-35
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 01:52:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:52:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:52:05] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-20 01:52:05] [WARNING] Unknown XML tag in source file: size
[2023-03-20 01:52:05] [WARNING] Unknown XML tag in source file: color
[2023-03-20 01:52:05] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-20 01:52:05] [INFO ] Transformed 30 places.
[2023-03-20 01:52:05] [INFO ] Transformed 32 transitions.
[2023-03-20 01:52:05] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 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 TCPcondis-PT-35-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:05] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-20 01:52:06] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-20 01:52:06] [INFO ] Invariant cache hit.
[2023-03-20 01:52:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-20 01:52:06] [INFO ] Invariant cache hit.
[2023-03-20 01:52:06] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2023-03-20 01:52:06] [INFO ] Flatten gal took : 24 ms
[2023-03-20 01:52:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 01:52:06] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 2754 steps, including 0 resets, run visited all 23 properties in 259 ms. (steps per millisecond=10 )
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 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-00 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:(OR (LT s4 1) (LT s21 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 40 steps with 0 reset in 4 ms.
FORMULA TCPcondis-PT-35-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-00 finished in 495 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)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s15 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 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 121 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLFireability-01 finished in 613 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(p0)))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-02 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=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s9 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 9581 reset in 226 ms.
Stack based approach found an accepted trace after 75250 steps with 7259 reset with depth 15 and stack size 15 in 127 ms.
FORMULA TCPcondis-PT-35-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-02 finished in 685 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)||(G(p1)&&X((F(G(p0))&&p2)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:08] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-20 01:52:09] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s0 1), p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p2:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-03 finished in 432 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)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 15 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-20 01:52:09] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 01:52:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 01:52:09] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-20 01:52:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:52:09] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 17662 steps with 0 reset with depth 17663 and stack size 17663 in 43 ms.
FORMULA TCPcondis-PT-35-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-05 finished in 430 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' '!((p0 U (!p1||X((X(G((!p1||F(p0)))) U (!p1&&X(G((!p1||F(p0))))))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:09] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-20 01:52:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 01:52:09] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-20 01:52:09] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s21 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2609 reset in 185 ms.
Product exploration explored 100000 steps with 2583 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 253 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
[2023-03-20 01:52:11] [INFO ] Invariant cache hit.
[2023-03-20 01:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:11] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG p1
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 8 factoid took 235 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLFireability-06 finished in 2259 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)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 14 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-20 01:52:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 01:52:12] [INFO ] Invariant cache hit.
[2023-03-20 01:52:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-20 01:52:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:52:12] [INFO ] Invariant cache hit.
[2023-03-20 01:52:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Stack based approach found an accepted trace after 18414 steps with 0 reset with depth 18415 and stack size 18412 in 39 ms.
FORMULA TCPcondis-PT-35-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-07 finished in 459 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) U !p1))||F(p2)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 01:52:12] [INFO ] Invariant cache hit.
[2023-03-20 01:52:12] [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-20 01:52:12] [INFO ] Invariant cache hit.
[2023-03-20 01:52:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s24 1), p1:(OR (AND (GEQ s13 1) (GEQ s25 1)) (AND (GEQ s7 1) (GEQ s19 1))), p0:(AND (GEQ s13 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15245 reset in 103 ms.
Product exploration explored 100000 steps with 15145 reset in 119 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) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 415 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Finished random walk after 397 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=198 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 519 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:14] [INFO ] Invariant cache hit.
[2023-03-20 01:52:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 01:52:14] [INFO ] Invariant cache hit.
[2023-03-20 01:52:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-20 01:52:14] [INFO ] Invariant cache hit.
[2023-03-20 01:52:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 30/30 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Finished random walk after 1514 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=252 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 511 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 14997 reset in 111 ms.
Product exploration explored 100000 steps with 15125 reset in 110 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 127 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 28 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 9 rules in 9 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-20 01:52:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 01:52:16] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 01:52:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-35-LTLFireability-08 finished in 4085 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(X(X((G(p1)&&p0))))&&X(p2)) U p3)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s3 1) (GEQ s19 1) (GEQ s1 1)), p2:(GEQ s9 1), p0:(AND (GEQ s12 1) (GEQ s26 1)), p1:(AND (GEQ s12 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-09 finished in 437 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)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:16] [INFO ] Invariant cache hit.
[2023-03-20 01:52:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 01:52:17] [INFO ] Invariant cache hit.
[2023-03-20 01:52:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-20 01:52:17] [INFO ] Invariant cache hit.
[2023-03-20 01:52:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1768 reset in 145 ms.
Product exploration explored 100000 steps with 1786 reset in 165 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 685 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=342 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-20 01:52:18] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLFireability-10 finished in 1185 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&&F(p1)&&X(X(X(F(p2)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:18] [INFO ] Invariant cache hit.
[2023-03-20 01:52:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 01:52:18] [INFO ] Invariant cache hit.
[2023-03-20 01:52:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-20 01:52:18] [INFO ] Invariant cache hit.
[2023-03-20 01:52:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16 1), p1:(LT s1 1), p2:(OR (LT s9 1) (LT s25 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18334 reset in 180 ms.
Product exploration explored 100000 steps with 18393 reset in 212 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 (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:20] [INFO ] Invariant cache hit.
[2023-03-20 01:52:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 01:52:20] [INFO ] Invariant cache hit.
[2023-03-20 01:52:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-20 01:52:20] [INFO ] Invariant cache hit.
[2023-03-20 01:52:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 30/30 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 3890 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=486 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 18159 reset in 81 ms.
Product exploration explored 100000 steps with 18208 reset in 93 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 28 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 10 rules in 6 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-20 01:52:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 01:52:21] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:21] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 01:52:21] [INFO ] Invariant cache hit.
[2023-03-20 01:52:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-20 01:52:21] [INFO ] Invariant cache hit.
[2023-03-20 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-35-LTLFireability-11 finished in 3392 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' '!(!((p0 U G(p1)) U !F(X((G(p3)&&p2)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:21] [INFO ] Invariant cache hit.
[2023-03-20 01:52:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 01:52:21] [INFO ] Invariant cache hit.
[2023-03-20 01:52:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-20 01:52:21] [INFO ] Invariant cache hit.
[2023-03-20 01:52:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (NOT p3), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1)), p1:(AND (GEQ s4 1) (GEQ s18 1)), p2:(AND (GEQ s8 1) (GEQ s20 1)), p3:(AND (GEQ s5 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 247 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) (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 620 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Finished random walk after 8083 steps, including 2 resets, run visited all 3 properties in 9 ms. (steps per millisecond=898 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (AND p2 p3))]
Knowledge based reduction with 14 factoid took 616 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
[2023-03-20 01:52:24] [INFO ] Invariant cache hit.
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-20 01:52:24] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-20 01:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-20 01:52:24] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 01:52:24] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-20 01:52:24] [INFO ] Invariant cache hit.
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-20 01:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-20 01:52:24] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 01:52:24] [INFO ] Added : 21 causal constraints over 5 iterations in 65 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:24] [INFO ] Invariant cache hit.
[2023-03-20 01:52:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 01:52:24] [INFO ] Invariant cache hit.
[2023-03-20 01:52:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-20 01:52:24] [INFO ] Invariant cache hit.
[2023-03-20 01:52:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 30/30 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 p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Finished Best-First random walk after 1346 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=269 )
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (AND p2 p3))]
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
[2023-03-20 01:52:25] [INFO ] Invariant cache hit.
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-20 01:52:25] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 01:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:25] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 01:52:25] [INFO ] Added : 19 causal constraints over 4 iterations in 20 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-20 01:52:25] [INFO ] Invariant cache hit.
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 01:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-20 01:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:25] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 01:52:25] [INFO ] Added : 21 causal constraints over 5 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 262 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 4 place count 30 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 30 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 6 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:26] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 32/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:26] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-35-LTLFireability-12 finished in 5117 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||G(p1))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 6 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-20 01:52:26] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-20 01:52:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s5 1) (LT s15 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-13 finished in 184 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 (p1||G(!p0))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 01:52:26] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-20 01:52:26] [INFO ] Invariant cache hit.
[2023-03-20 01:52:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s13 1) (GEQ s25 1))) (NOT (AND (GEQ s4 1) (GEQ s22 1)))), p0:(AND (GEQ s4 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLFireability-14 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' '!(X((X(G((!p0||X(p1)))) U (p0&&X(G((!p0||X(p1))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s9 1), p1:(OR (AND (GEQ s5 1) (GEQ s21 1)) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLFireability-15 finished in 318 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) U !p1))||F(p2)))'
Found a Lengthening insensitive property : TCPcondis-PT-35-LTLFireability-08
Stuttering acceptance computed with spot in 127 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-20 01:52:27] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 99 ms. Remains : 25/30 places, 27/32 transitions.
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s20 1), p1:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s16 1))), p0:(AND (GEQ s11 1) (GEQ s21 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][false, false, false]]
Product exploration explored 100000 steps with 15155 reset in 101 ms.
Stack based approach found an accepted trace after 21228 steps with 3199 reset with depth 37 and stack size 37 in 23 ms.
Treatment of property TCPcondis-PT-35-LTLFireability-08 finished in 448 ms.
FORMULA TCPcondis-PT-35-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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&&F(p1)&&X(X(X(F(p2)))))))'
Found a Shortening insensitive property : TCPcondis-PT-35-LTLFireability-11
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 28
Applied a total of 8 rules in 5 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2023-03-20 01:52:28] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 01:52:28] [INFO ] Invariant cache hit.
[2023-03-20 01:52:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-20 01:52:28] [INFO ] Invariant cache hit.
[2023-03-20 01:52:28] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 26/30 places, 28/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 93 ms. Remains : 26/30 places, 28/32 transitions.
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s14 1), p1:(LT s1 1), p2:(OR (LT s8 1) (LT s22 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18538 reset in 83 ms.
Product exploration explored 100000 steps with 18495 reset in 89 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 (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 313 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 8 factoid took 314 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-20 01:52:29] [INFO ] Invariant cache hit.
[2023-03-20 01:52:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 01:52:29] [INFO ] Invariant cache hit.
[2023-03-20 01:52:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-20 01:52:29] [INFO ] Invariant cache hit.
[2023-03-20 01:52:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 26/26 places, 28/28 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 3386 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1128 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 18528 reset in 86 ms.
Product exploration explored 100000 steps with 18486 reset in 87 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 26 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 26 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-20 01:52:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2023-03-20 01:52:30] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 01:52:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 28/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 26/26 places, 28/28 transitions.
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 26 cols
[2023-03-20 01:52:31] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 01:52:31] [INFO ] Invariant cache hit.
[2023-03-20 01:52:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-20 01:52:31] [INFO ] Invariant cache hit.
[2023-03-20 01:52:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 26/26 places, 28/28 transitions.
Treatment of property TCPcondis-PT-35-LTLFireability-11 finished in 3033 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' '!(!((p0 U G(p1)) U !F(X((G(p3)&&p2)))))'
Found a Shortening insensitive property : TCPcondis-PT-35-LTLFireability-12
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (NOT p3), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Applied a total of 4 rules in 4 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 01:52:31] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 01:52:31] [INFO ] Invariant cache hit.
[2023-03-20 01:52:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-20 01:52:31] [INFO ] Invariant cache hit.
[2023-03-20 01:52:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 102 ms. Remains : 28/30 places, 30/32 transitions.
Running random walk in product with property : TCPcondis-PT-35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s19 1)), p1:(AND (GEQ s4 1) (GEQ s17 1)), p2:(AND (GEQ s8 1) (GEQ s19 1)), p3:(AND (GEQ s5 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Product exploration explored 100000 steps with 0 reset in 290 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) (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 633 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 3) seen :1
Finished Best-First random walk after 513 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=256 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (AND p2 p3))]
Knowledge based reduction with 14 factoid took 649 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
[2023-03-20 01:52:33] [INFO ] Invariant cache hit.
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-20 01:52:33] [INFO ] Computed and/alt/rep : 26/96/26 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 01:52:33] [INFO ] Added : 25 causal constraints over 7 iterations in 30 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-20 01:52:33] [INFO ] Invariant cache hit.
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 01:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-20 01:52:33] [INFO ] Computed and/alt/rep : 26/96/26 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 01:52:34] [INFO ] Added : 22 causal constraints over 7 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-20 01:52:34] [INFO ] Invariant cache hit.
[2023-03-20 01:52:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 01:52:34] [INFO ] Invariant cache hit.
[2023-03-20 01:52:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-20 01:52:34] [INFO ] Invariant cache hit.
[2023-03-20 01:52:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 28/28 places, 30/30 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 p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 3) seen :1
Finished Best-First random walk after 996 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=332 )
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (X (NOT p3))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F p3), (F (AND p2 p3))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
[2023-03-20 01:52:34] [INFO ] Invariant cache hit.
[2023-03-20 01:52:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:34] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-20 01:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:35] [INFO ] Computed and/alt/rep : 26/96/26 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 01:52:35] [INFO ] Added : 25 causal constraints over 7 iterations in 27 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-20 01:52:35] [INFO ] Invariant cache hit.
[2023-03-20 01:52:35] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 01:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 01:52:35] [INFO ] Computed and/alt/rep : 26/96/26 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 01:52:35] [INFO ] Added : 22 causal constraints over 7 iterations in 29 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 240 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 30/30 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 2 place count 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 4 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-20 01:52:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 01:52:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 01:52:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/28 places, 30/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41 ms. Remains : 28/28 places, 30/30 transitions.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 01:52:35] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 01:52:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 01:52:36] [INFO ] Invariant cache hit.
[2023-03-20 01:52:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-20 01:52:36] [INFO ] Invariant cache hit.
[2023-03-20 01:52:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 28/28 places, 30/30 transitions.
Treatment of property TCPcondis-PT-35-LTLFireability-12 finished in 4943 ms.
[2023-03-20 01:52:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 01:52:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 01:52:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 0 ms.
Total runtime 30634 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2531/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2531/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2531/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TCPcondis-PT-35-LTLFireability-08
Could not compute solution for formula : TCPcondis-PT-35-LTLFireability-11
Could not compute solution for formula : TCPcondis-PT-35-LTLFireability-12

BK_STOP 1679277157344

--------------------
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 TCPcondis-PT-35-LTLFireability-08
ltl formula formula --ltl=/tmp/2531/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 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2531/ltl_0_
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( 0/ 4): LTL layer: formula: /tmp/2531/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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
ltl formula name TCPcondis-PT-35-LTLFireability-11
ltl formula formula --ltl=/tmp/2531/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
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 30 places, 32 transitions and 108 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( 3/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2531/ltl_1_
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/2531/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2531/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 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 TCPcondis-PT-35-LTLFireability-12
ltl formula formula --ltl=/tmp/2531/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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
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
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/2531/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2531/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2531/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2531/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 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:
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="TCPcondis-PT-35"
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 TCPcondis-PT-35, 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 r489-tall-167912706900548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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