Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678273998088

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N1000P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 11:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:13:21] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-08 11:13:21] [INFO ] Transformed 25 places.
[2023-03-08 11:13:21] [INFO ] Transformed 18 transitions.
[2023-03-08 11:13:21] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 15 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 11:13:21] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-08 11:13:21] [INFO ] Implicit Places using invariants in 187 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 237 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 254 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2023-03-08 11:13:22] [INFO ] Flatten gal took : 35 ms
[2023-03-08 11:13:22] [INFO ] Flatten gal took : 11 ms
[2023-03-08 11:13:22] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16004 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=347 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :6
Finished Best-First random walk after 983 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=89 )
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(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 11:13:22] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 11:13:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 11:13:23] [INFO ] Invariant cache hit.
[2023-03-08 11:13:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-08 11:13:23] [INFO ] Invariant cache hit.
[2023-03-08 11:13:23] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s6 1) (GEQ s9 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-00 finished in 656 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 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 3 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:13:23] [INFO ] Invariant cache hit.
[2023-03-08 11:13:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 11:13:23] [INFO ] Invariant cache hit.
[2023-03-08 11:13:23] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 11:13:23] [INFO ] Invariant cache hit.
[2023-03-08 11:13:23] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-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 25005 reset in 541 ms.
Product exploration explored 100000 steps with 24956 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 197 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 50 ms :[(NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 222 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 11:13:25] [INFO ] Invariant cache hit.
[2023-03-08 11:13:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 11:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 11:13:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 11:13:25] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 8 transition count 6
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 3 with 4 rules applied. Total rules applied 28 place count 6 transition count 4
Applied a total of 28 rules in 21 ms. Remains 6 /20 variables (removed 14) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-08 11:13:25] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:13:25] [INFO ] Implicit Places using invariants in 49 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/20 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 5/20 places, 4/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-01 finished in 2029 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 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
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 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 9 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-08 11:13:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 11:13:25] [INFO ] Invariant cache hit.
[2023-03-08 11:13:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 11:13:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:25] [INFO ] Invariant cache hit.
[2023-03-08 11:13:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 8/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 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 275 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-02 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((G(p0)||X(X(X(F(!p1)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 11:13:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 11:13:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 11:13:26] [INFO ] Invariant cache hit.
[2023-03-08 11:13:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 11:13:26] [INFO ] Invariant cache hit.
[2023-03-08 11:13:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 517 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(GEQ s15 1), p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1221 reset in 235 ms.
Product exploration explored 100000 steps with 1996 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p1, p1, p1, p1, p1]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1778 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 252 ms :[p1, p1, p1, p1, p1]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:13:28] [INFO ] Invariant cache hit.
[2023-03-08 11:13:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 11:13:28] [INFO ] Invariant cache hit.
[2023-03-08 11:13:28] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-08 11:13:28] [INFO ] Invariant cache hit.
[2023-03-08 11:13:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p1, p1, p1, p1, p1]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 1791 reset in 228 ms.
Product exploration explored 100000 steps with 2292 reset in 358 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 291 ms :[p1, p1, p1, p1, p1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 16 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 26 rules in 15 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-08 11:13:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2023-03-08 11:13:31] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-08 11:13:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 14/20 places, 12/18 transitions.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 11:13:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:13:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 11:13:31] [INFO ] Invariant cache hit.
[2023-03-08 11:13:31] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 11:13:31] [INFO ] Invariant cache hit.
[2023-03-08 11:13:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-03 finished in 5600 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)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
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 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 8 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-08 11:13:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:31] [INFO ] Implicit Places using invariants in 45 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4490 reset in 196 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-04 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((X(p1)&&p0))&&X(p1))) U p2))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:13:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 11:13:32] [INFO ] Invariant cache hit.
[2023-03-08 11:13:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-08 11:13:32] [INFO ] Invariant cache hit.
[2023-03-08 11:13:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s16 1), p2:(OR (GEQ s19 1) (GEQ s16 1)), p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 977 reset in 237 ms.
Product exploration explored 100000 steps with 995 reset in 233 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 587 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=2286 ) properties (out of 6) seen :0
Finished Best-First random walk after 432 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND p0 p2 p1)), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 786 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:13:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 11:13:35] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:13:35] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:13:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:35] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:13:35] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:13:35] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:13:35] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-08 11:13:35] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-08 11:13:35] [INFO ] Invariant cache hit.
[2023-03-08 11:13:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 733 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=2286 ) properties (out of 6) seen :0
Finished Best-First random walk after 1235 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=205 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND p0 p2 p1)), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 789 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-08 11:13:38] [INFO ] Invariant cache hit.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:13:38] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 11:13:38] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 11:13:38] [INFO ] Invariant cache hit.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:38] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 11:13:38] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:13:38] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 11:13:38] [INFO ] Invariant cache hit.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-08 11:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 11:13:38] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:13:38] [INFO ] Added : 13 causal constraints over 3 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 963 reset in 202 ms.
Product exploration explored 100000 steps with 968 reset in 224 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:13:39] [INFO ] Invariant cache hit.
[2023-03-08 11:13:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 11:13:39] [INFO ] Invariant cache hit.
[2023-03-08 11:13:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 11:13:39] [INFO ] Invariant cache hit.
[2023-03-08 11:13:39] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-05 finished in 7423 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 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:13:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 11:13:39] [INFO ] Invariant cache hit.
[2023-03-08 11:13:39] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 11:13:39] [INFO ] Invariant cache hit.
[2023-03-08 11:13:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5759 reset in 135 ms.
Product exploration explored 100000 steps with 5734 reset in 148 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 : []
Knowledge based reduction with 3 factoid took 154 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 49 ms :[p0]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Finished Best-First random walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 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 50 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
[2023-03-08 11:13:40] [INFO ] Invariant cache hit.
[2023-03-08 11:13:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 11:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 11:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 11:13:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:13:40] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 10 transition count 7
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 3 with 4 rules applied. Total rules applied 26 place count 8 transition count 5
Applied a total of 26 rules in 8 ms. Remains 8 /21 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-08 11:13:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:40] [INFO ] Implicit Places using invariants in 30 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 7/21 places, 5/18 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 11:13:41] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:13:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 11:13:41] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 11:13:41] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 15053 reset in 51 ms.
Product exploration explored 100000 steps with 15145 reset in 89 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 11:13:41] [INFO ] Invariant cache hit.
[2023-03-08 11:13:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:13:41] [INFO ] Invariant cache hit.
[2023-03-08 11:13:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 11:13:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:41] [INFO ] Invariant cache hit.
[2023-03-08 11:13:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-06 finished in 2022 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(F((X(p0) U p1))))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 15 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 5 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:13:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:13:41] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5726 reset in 118 ms.
Product exploration explored 100000 steps with 5752 reset in 135 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :0
Finished Best-First random walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 11:13:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:13:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 11:13:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 11:13:42] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:13:42] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:13:42] [INFO ] Invariant cache hit.
[2023-03-08 11:13:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:13:42] [INFO ] Invariant cache hit.
[2023-03-08 11:13:42] [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-08 11:13:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:42] [INFO ] Invariant cache hit.
[2023-03-08 11:13:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3336 ) properties (out of 1) seen :0
Finished Best-First random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
[2023-03-08 11:13:43] [INFO ] Invariant cache hit.
[2023-03-08 11:13:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 11:13:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:13:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 11:13:43] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:13:43] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5707 reset in 121 ms.
Product exploration explored 100000 steps with 5663 reset in 138 ms.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 6 transition count 5
Applied a total of 5 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 11:13:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 11:13:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 6/9 places, 5/7 transitions.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-07 finished in 2668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(p0)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 1 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 11:13:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), false, false]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-08 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: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s13 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 16 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-08 finished in 323 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(((p1 U !p2)&&p0))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 11
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 3 with 4 rules applied. Total rules applied 20 place count 12 transition count 9
Applied a total of 20 rules in 7 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:13:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 11:13:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:44] [INFO ] Invariant cache hit.
[2023-03-08 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 12/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s9 1)), p0:(AND (GEQ s4 1) (GEQ s7 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1553 reset in 219 ms.
Stack based approach found an accepted trace after 852 steps with 12 reset with depth 30 and stack size 30 in 4 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-09 finished in 488 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&&(p1 U X((F(p3)&&p2)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:13:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 11:13:45] [INFO ] Invariant cache hit.
[2023-03-08 11:13:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-08 11:13:45] [INFO ] Invariant cache hit.
[2023-03-08 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s20 1), p1:(AND (GEQ s1 1) (GEQ s17 1)), p2:(AND (GEQ s6 1) (GEQ s1 1) (GEQ s17 1)), p3:(GEQ s6 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 788 reset in 257 ms.
Stack based approach found an accepted trace after 10842 steps with 80 reset with depth 19 and stack size 19 in 41 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-10 finished in 732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X((!p2||F(p0)))&&p1))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:13:45] [INFO ] Invariant cache hit.
[2023-03-08 11:13:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 11:13:45] [INFO ] Invariant cache hit.
[2023-03-08 11:13:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 11:13:45] [INFO ] Invariant cache hit.
[2023-03-08 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p0) p2)), true, (NOT p0), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(OR (LT s0 1) (LT s13 1)), p2:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 8 factoid took 452 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-11 finished in 1175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!p0)||X(F(p1))) U X(X(p2)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:13:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:13:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 11:13:46] [INFO ] Invariant cache hit.
[2023-03-08 11:13:47] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 11:13:47] [INFO ] Invariant cache hit.
[2023-03-08 11:13:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 730 ms :[(AND (NOT p1) p0), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 11}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}, { cond=(NOT p1), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 11}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=11 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 11}]], initial=4, aps=[p0:(OR (LT s11 1) (LT s16 1)), p1:(AND (GEQ s7 1) (GEQ s20 1)), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1809 reset in 239 ms.
Product exploration explored 100000 steps with 1789 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 12 states, 37 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2667 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 11:13:49] [INFO ] Invariant cache hit.
[2023-03-08 11:13:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:49] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:49] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:13:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:13:49] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:13:49] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 11:13:49] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 63 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 788 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 623 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 705 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2023-03-08 11:13:52] [INFO ] Invariant cache hit.
[2023-03-08 11:13:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 7 factoid took 519 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-12 finished in 5698 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 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
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 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 7 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-08 11:13:52] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 11:13:52] [INFO ] Implicit Places using invariants in 37 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 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 128 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-14 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((X(p1)&&p0))&&X(p1))) U p2))'
Found a Shortening insensitive property : ClientsAndServers-PT-N1000P0-LTLFireability-05
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 11
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 3 with 4 rules applied. Total rules applied 20 place count 12 transition count 9
Applied a total of 20 rules in 5 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:13:53] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:13:53] [INFO ] Implicit Places using invariants in 33 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/23 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 42 ms. Remains : 11/23 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s8 1), p2:(OR (GEQ s10 1) (GEQ s8 1)), p0:(AND (GEQ s1 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2872 reset in 152 ms.
Stack based approach found an accepted trace after 322 steps with 7 reset with depth 34 and stack size 34 in 1 ms.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-05 finished in 570 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N1000P0-LTLFireability-06
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
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 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 5 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-08 11:13:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:13:53] [INFO ] Implicit Places using invariants in 33 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 40 ms. Remains : 7/23 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15033 reset in 86 ms.
Product exploration explored 100000 steps with 15062 reset in 108 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 : []
Knowledge based reduction with 3 factoid took 148 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 47 ms :[p0]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 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 50 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 11:13:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 11:13:54] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:13:54] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 11:13:54] [INFO ] Invariant cache hit.
[2023-03-08 11:13:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 11:13:54] [INFO ] Invariant cache hit.
[2023-03-08 11:13:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-08 11:13:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:54] [INFO ] Invariant cache hit.
[2023-03-08 11:13:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 7/7 places, 5/5 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Finished random walk after 2003 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2003 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-03-08 11:13:55] [INFO ] Invariant cache hit.
[2023-03-08 11:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:13:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 11:13:55] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 11:13:55] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 15219 reset in 70 ms.
Product exploration explored 100000 steps with 15121 reset in 60 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 11:13:55] [INFO ] Invariant cache hit.
[2023-03-08 11:13:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:13:55] [INFO ] Invariant cache hit.
[2023-03-08 11:13:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 11:13:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:13:55] [INFO ] Invariant cache hit.
[2023-03-08 11:13:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-06 finished in 1879 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(F((X(p0) U p1))))))'
[2023-03-08 11:13:55] [INFO ] Flatten gal took : 7 ms
[2023-03-08 11:13:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 11:13:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 48 arcs took 1 ms.
Total runtime 34536 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N1000P0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678274062022

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:524
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N1000P0-LTLFireability-05
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N1000P0-LTLFireability-05
lola: result : false
lola: markings : 54001
lola: fired transitions : 54001
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N1000P0-LTLFireability-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1199 14/32 ClientsAndServers-PT-N1000P0-LTLFireability-06 2070347 m, 414069 m/sec, 4521450 t fired, .

Time elapsed: 5 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1199 27/32 ClientsAndServers-PT-N1000P0-LTLFireability-06 4036038 m, 393138 m/sec, 9135249 t fired, .

Time elapsed: 10 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ClientsAndServers-PT-N1000P0-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N1000P0-LTLFireability-03
lola: time limit : 1792 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N1000P0-LTLFireability-03
lola: result : false
lola: markings : 94033
lola: fired transitions : 94038
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N1000P0-LTLFireability-07
lola: time limit : 3584 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL false LTL model checker
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 4/3584 31/32 ClientsAndServers-PT-N1000P0-LTLFireability-07 4554287 m, 910857 m/sec, 5777334 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ClientsAndServers-PT-N1000P0-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL false LTL model checker
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N1000P0-LTLFireability-03: LTL false LTL model checker
ClientsAndServers-PT-N1000P0-LTLFireability-05: LTL false LTL model checker
ClientsAndServers-PT-N1000P0-LTLFireability-06: LTL unknown AGGR
ClientsAndServers-PT-N1000P0-LTLFireability-07: LTL unknown AGGR


Time elapsed: 25 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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