Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:17 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.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:18 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.2K 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-N0050P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0050P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678392475281

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0050P0
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 20:07:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 20:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:07:58] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-09 20:07:58] [INFO ] Transformed 25 places.
[2023-03-09 20:07:58] [INFO ] Transformed 18 transitions.
[2023-03-09 20:07:58] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 131 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 4 formulas.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-14 TRUE 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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 16 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 20:07:58] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-09 20:07:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-09 20:07:58] [INFO ] Invariant cache hit.
[2023-03-09 20:07:58] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-09 20:07:58] [INFO ] Invariant cache hit.
[2023-03-09 20:07:58] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2023-03-09 20:07:59] [INFO ] Flatten gal took : 22 ms
[2023-03-09 20:07:59] [INFO ] Flatten gal took : 7 ms
[2023-03-09 20:07:59] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 2826 steps, including 0 resets, run visited all 18 properties in 31 ms. (steps per millisecond=91 )
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:07:59] [INFO ] Invariant cache hit.
[2023-03-09 20:07:59] [INFO ] Implicit Places using invariants in 43 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(OR (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-00 finished in 434 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)||X(F((p1&&X(p2)))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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.
[2023-03-09 20:08:00] [INFO ] Invariant cache hit.
[2023-03-09 20:08:00] [INFO ] Implicit Places using invariants in 44 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s9 1), p1:(LT s6 1), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1058 reset in 396 ms.
Product exploration explored 100000 steps with 1054 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 592 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10091 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=388 ) properties (out of 8) seen :6
Finished Best-First random walk after 1188 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 780 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 20:08:02] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 20:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-09 20:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 20:08:03] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 20:08:03] [INFO ] Added : 14 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 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 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:08:03] [INFO ] Invariant cache hit.
[2023-03-09 20:08:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 20:08:03] [INFO ] Invariant cache hit.
[2023-03-09 20:08:03] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 20:08:03] [INFO ] Invariant cache hit.
[2023-03-09 20:08:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 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 : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 561 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10091 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=347 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 20:08:04] [INFO ] Invariant cache hit.
[2023-03-09 20:08:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 20:08:04] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 20:08:04] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:08:04] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:08:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:04] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:08:04] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:08:04] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 79 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 13 factoid took 826 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-09 20:08:05] [INFO ] Invariant cache hit.
[2023-03-09 20:08:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-09 20:08:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 20:08:05] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 20:08:05] [INFO ] Added : 14 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1087 reset in 221 ms.
Product exploration explored 100000 steps with 1077 reset in 234 ms.
Support contains 3 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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:08:06] [INFO ] Invariant cache hit.
[2023-03-09 20:08:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 20:08:06] [INFO ] Invariant cache hit.
[2023-03-09 20:08:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 20:08:06] [INFO ] Invariant cache hit.
[2023-03-09 20:08:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-01 finished in 6372 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 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 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 23 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 12 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 20:08:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:08:06] [INFO ] Implicit Places using invariants in 27 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 20:08:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 20:08:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 20:08:06] [INFO ] Invariant cache hit.
[2023-03-09 20:08:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-02 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:(GEQ s5 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 13946 reset in 78 ms.
Product exploration explored 100000 steps with 13650 reset in 328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-09 20:08:07] [INFO ] Invariant cache hit.
[2023-03-09 20:08:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 20:08:07] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 20:08:07] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 20:08:07] [INFO ] Invariant cache hit.
[2023-03-09 20:08:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 20:08:07] [INFO ] Invariant cache hit.
[2023-03-09 20:08:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 20:08:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:08:07] [INFO ] Invariant cache hit.
[2023-03-09 20:08:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 6/6 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=203 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 151 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2023-03-09 20:08:08] [INFO ] Invariant cache hit.
[2023-03-09 20:08:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 20:08:08] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 20:08:08] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13917 reset in 68 ms.
Product exploration explored 100000 steps with 13669 reset in 91 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 3 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 20:08:08] [INFO ] Invariant cache hit.
[2023-03-09 20:08:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 20:08:08] [INFO ] Invariant cache hit.
[2023-03-09 20:08:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-09 20:08:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:08:08] [INFO ] Invariant cache hit.
[2023-03-09 20:08:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-02 finished in 2233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (p0&&X(p1))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 20:08:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 20:08:08] [INFO ] Implicit Places using invariants in 38 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 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.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s4 1) (GEQ s18 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-03 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((G(p0)||G(!p1))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 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 9 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 17 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 11 place count 17 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 15 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 12 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 23 place count 11 transition count 7
Applied a total of 23 rules in 22 ms. Remains 11 /23 variables (removed 12) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-09 20:08:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 20:08:09] [INFO ] Implicit Places using invariants in 33 ms returned [4, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 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 57 ms. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(LT s8 1), p1:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 202 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 121 in 1 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-04 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(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.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 20:08:09] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 20:08:09] [INFO ] Implicit Places using invariants in 39 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[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][false, false, false, false]]
Product exploration explored 100000 steps with 1214 reset in 103 ms.
Product exploration explored 100000 steps with 1207 reset in 183 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5247 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1311 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 20:08:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:08:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 20:08:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-09 20:08:10] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 20:08:10] [INFO ] Added : 14 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
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.
[2023-03-09 20:08:10] [INFO ] Invariant cache hit.
[2023-03-09 20:08:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 20:08:10] [INFO ] Invariant cache hit.
[2023-03-09 20:08:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-09 20:08:10] [INFO ] Invariant cache hit.
[2023-03-09 20:08:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 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 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2725 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1362 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 20:08:11] [INFO ] Invariant cache hit.
[2023-03-09 20:08:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 20:08:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-09 20:08:11] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 20:08:11] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1201 reset in 104 ms.
Product exploration explored 100000 steps with 1182 reset in 110 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (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.
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 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-09 20:08:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2023-03-09 20:08:12] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:08:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 15/20 places, 13/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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 20:08:12] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:08:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 20:08:12] [INFO ] Invariant cache hit.
[2023-03-09 20:08:12] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 20:08:12] [INFO ] Invariant cache hit.
[2023-03-09 20:08:12] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-09 finished in 2975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(F(p1))) U p2))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 17 transition count 12
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 13 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 13 transition count 9
Applied a total of 19 rules in 3 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-09 20:08:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 20:08:12] [INFO ] Implicit Places using invariants in 28 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-09 20:08:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 20:08:12] [INFO ] Implicit Places using invariants in 23 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/23 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 58 ms. Remains : 10/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s6 1) (AND (GEQ s1 1) (GEQ s8 1))), p0:(GEQ s6 1), p1:(OR (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7986 reset in 87 ms.
Product exploration explored 100000 steps with 8040 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 534 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 809 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=404 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 669 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 8 rows 10 cols
[2023-03-09 20:08:14] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:08:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 20:08:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 20:08:14] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 20:08:14] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-09 20:08:14] [INFO ] Invariant cache hit.
[2023-03-09 20:08:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 20:08:14] [INFO ] Invariant cache hit.
[2023-03-09 20:08:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-09 20:08:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:08:14] [INFO ] Invariant cache hit.
[2023-03-09 20:08:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 809 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=404 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 693 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
[2023-03-09 20:08:16] [INFO ] Invariant cache hit.
[2023-03-09 20:08:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 20:08:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-09 20:08:16] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 20:08:16] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7922 reset in 82 ms.
Product exploration explored 100000 steps with 7869 reset in 107 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-09 20:08:16] [INFO ] Invariant cache hit.
[2023-03-09 20:08:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 20:08:16] [INFO ] Invariant cache hit.
[2023-03-09 20:08:16] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-09 20:08:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-10 finished in 4693 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)&&F(p1))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 20:08:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 20:08:17] [INFO ] Implicit Places using invariants in 38 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s8 1) (LT s14 1)), p1:(OR (LT s5 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-11 finished in 177 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(!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.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] Implicit Places using invariants in 38 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR p1 p0), (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s9 1), p1:(GEQ s10 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 58 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-12 finished in 201 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((G(p0) U X((G(!p1)||X((p2 U (p3||G(p2))))))))))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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.
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] Implicit Places using invariants in 32 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 541 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) p1), true, (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 10}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=9 dest: 9}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=9 dest: 9}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 6}, { cond=(NOT p1), acceptance={} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 6}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p0 p1), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(GEQ s10 1), p1:(AND (GEQ s7 1) (GEQ s20 1)), p3:(AND (NOT (AND (GEQ s3 1) (GEQ s14 1))) (OR (LT s5 1) (LT s15 1))), p2:(OR (LT s5 1) (LT s15 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2178 steps with 354 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-13 finished in 621 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(!p1)&&F(!p2)&&p0)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 20:08:18] [INFO ] Invariant cache hit.
[2023-03-09 20:08:18] [INFO ] Implicit Places using invariants in 35 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p2 p1), (OR (NOT p0) p2 p1), true, p1, p2]
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s15 1) (GEQ s9 1)), p1:(OR (LT s8 1) (LT s14 1)), p2:(LT s15 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0050P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-15 finished in 252 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)||X(F((p1&&X(p2)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0050P0-LTLFireability-01
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 15 transition count 11
Applied a total of 15 rules in 4 ms. Remains 15 /23 variables (removed 8) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-09 20:08:18] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 20:08:18] [INFO ] Implicit Places using invariants in 31 ms returned [10, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/23 places, 11/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 11 transition count 9
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 6 place count 10 transition count 8
Applied a total of 6 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-09 20:08:18] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 20:08:18] [INFO ] Implicit Places using invariants in 25 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/23 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 66 ms. Remains : 9/23 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(LT s3 1), p2:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1810 reset in 131 ms.
Stack based approach found an accepted trace after 357 steps with 11 reset with depth 21 and stack size 21 in 1 ms.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-01 finished in 446 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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0050P0-LTLFireability-09
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 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 23 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 12 transition count 8
Applied a total of 21 rules in 4 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 20:08:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 20:08:19] [INFO ] Implicit Places using invariants in 42 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/23 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 20:08:19] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 20:08:19] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 77 ms. Remains : 6/23 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0050P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10251 reset in 66 ms.
Product exploration explored 100000 steps with 10272 reset in 71 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 810 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=810 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 20:08:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 20:08:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 20:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-09 20:08:20] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 20:08:20] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 20:08:20] [INFO ] Invariant cache hit.
[2023-03-09 20:08:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 20:08:20] [INFO ] Invariant cache hit.
[2023-03-09 20:08:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 20:08:20] [INFO ] Invariant cache hit.
[2023-03-09 20:08:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 6/6 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 304 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=304 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 20:08:20] [INFO ] Invariant cache hit.
[2023-03-09 20:08:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 20:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:08:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 20:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:08:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-09 20:08:20] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 20:08:20] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10261 reset in 66 ms.
Product exploration explored 100000 steps with 10260 reset in 69 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 20:08:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:08:21] [INFO ] Invariant cache hit.
[2023-03-09 20:08:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 20:08:21] [INFO ] Invariant cache hit.
[2023-03-09 20:08:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 20:08:21] [INFO ] Invariant cache hit.
[2023-03-09 20:08:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-09 20:08:21] [INFO ] Invariant cache hit.
[2023-03-09 20:08:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0050P0-LTLFireability-09 finished in 2724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(F(p1))) U p2))'
[2023-03-09 20:08:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 20:08:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 20:08:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 50 arcs took 0 ms.
Total runtime 23574 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLFireability-01
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLFireability-02
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLFireability-09
Could not compute solution for formula : ClientsAndServers-PT-N0050P0-LTLFireability-10

BK_STOP 1678392503091

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ClientsAndServers-PT-N0050P0-LTLFireability-02
ltl formula formula --ltl=/tmp/2009/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name ClientsAndServers-PT-N0050P0-LTLFireability-09
ltl formula formula --ltl=/tmp/2009/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name ClientsAndServers-PT-N0050P0-LTLFireability-10
ltl formula formula --ltl=/tmp/2009/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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