Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:25 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.3K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:27 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-N5000P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678275018601

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N5000P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 11:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:30:22] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-08 11:30:22] [INFO ] Transformed 25 places.
[2023-03-08 11:30:22] [INFO ] Transformed 18 transitions.
[2023-03-08 11:30:22] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 22 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 11:30:23] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 11:30:23] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 11:30:23] [INFO ] Invariant cache hit.
[2023-03-08 11:30:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 11:30:23] [INFO ] Invariant cache hit.
[2023-03-08 11:30:23] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 18 out of 24 places after structural reductions.
[2023-03-08 11:30:23] [INFO ] Flatten gal took : 38 ms
[2023-03-08 11:30:23] [INFO ] Flatten gal took : 20 ms
[2023-03-08 11:30:23] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 40001 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=571 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 11:30:24] [INFO ] Invariant cache hit.
[2023-03-08 11:30:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 11:30:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:30:24] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:30:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 11:30:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:30:24] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:30:24] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 11:30:24] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 170000 steps, including 0 resets, run visited all 1 properties in 633 ms. (steps per millisecond=268 )
Parikh walk visited 1 properties in 638 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-13 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' '!(G(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 16 transition count 13
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 12
Deduced a syphon composed of 1 places in 8 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 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 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 9
Applied a total of 21 rules in 36 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:30:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:25] [INFO ] Implicit Places using invariants in 69 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 9/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 7
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 7
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-08 11:30:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 11:30:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 11:30:25] [INFO ] Invariant cache hit.
[2023-03-08 11:30:25] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2919 reset in 503 ms.
Stack based approach found an accepted trace after 1828 steps with 58 reset with depth 34 and stack size 34 in 8 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-00 finished in 1167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:30:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 11:30:26] [INFO ] Implicit Places using invariants in 71 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 79 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-01 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 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 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 15 place count 15 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 4 with 6 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 14 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:30:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:26] [INFO ] Implicit Places using invariants in 41 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s10 1), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4527 reset in 203 ms.
Product exploration explored 100000 steps with 4498 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 9 rows 11 cols
[2023-03-08 11:30:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 11:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 11:30:28] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:30:28] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:30:28] [INFO ] Invariant cache hit.
[2023-03-08 11:30:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 11:30:28] [INFO ] Invariant cache hit.
[2023-03-08 11:30:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 11:30:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:30:28] [INFO ] Invariant cache hit.
[2023-03-08 11:30:28] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 11/11 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :0
Finished Best-First random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-08 11:30:29] [INFO ] Invariant cache hit.
[2023-03-08 11:30:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 11:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 11:30:29] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:30:29] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4520 reset in 172 ms.
Product exploration explored 100000 steps with 4540 reset in 173 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:30:29] [INFO ] Invariant cache hit.
[2023-03-08 11:30:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 11:30:29] [INFO ] Invariant cache hit.
[2023-03-08 11:30:29] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 11:30:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:30:29] [INFO ] Invariant cache hit.
[2023-03-08 11:30:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 11/11 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-02 finished in 2823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&F((p0&&F(!p1))))||G((F(!p1)&&F(p0)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:30:29] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:30:29] [INFO ] Implicit Places using invariants in 58 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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 62 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 612 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=5000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:30:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:30:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:30:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:30:31] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:30:31] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 11:30:31] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 12 transition count 7
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 22 place count 10 transition count 7
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 9 transition count 6
Applied a total of 24 rules in 4 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 9/21 places, 6/18 transitions.
Incomplete random walk after 40001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=5714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 396035 steps, run visited all 2 properties in 2370 ms. (steps per millisecond=167 )
Probabilistic random walk after 396035 steps, saw 271373 distinct states, run finished after 2371 ms. (steps per millisecond=167 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
[2023-03-08 11:30:36] [INFO ] Invariant cache hit.
[2023-03-08 11:30:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:30:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 11:30:36] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:30:36] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:30:36] [INFO ] Invariant cache hit.
[2023-03-08 11:30:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:30:36] [INFO ] Invariant cache hit.
[2023-03-08 11:30:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-08 11:30:36] [INFO ] Invariant cache hit.
[2023-03-08 11:30:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=2105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:30:37] [INFO ] Invariant cache hit.
[2023-03-08 11:30:37] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:30:37] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:30:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-08 11:30:37] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:30:37] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 11:30:37] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 12 transition count 7
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 22 place count 10 transition count 7
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 9 transition count 6
Applied a total of 24 rules in 4 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 9/21 places, 6/18 transitions.
Incomplete random walk after 40001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=1739 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished probabilistic random walk after 396035 steps, run visited all 2 properties in 2989 ms. (steps per millisecond=132 )
Probabilistic random walk after 396035 steps, saw 271373 distinct states, run finished after 2990 ms. (steps per millisecond=132 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
[2023-03-08 11:30:43] [INFO ] Invariant cache hit.
[2023-03-08 11:30:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 11:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:30:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:30:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:30:43] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:30:43] [INFO ] Added : 9 causal constraints over 2 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 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 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 16 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 16 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 12
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 23 rules in 18 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-08 11:30:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2023-03-08 11:30:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 15/21 places, 12/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:30:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 11:30:44] [INFO ] Invariant cache hit.
[2023-03-08 11:30:44] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 11:30:44] [INFO ] Invariant cache hit.
[2023-03-08 11:30:44] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-04 finished in 15353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1&&F(p2)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:30:45] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:30:45] [INFO ] Implicit Places using invariants in 54 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 57 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LT s16 1), p0:(AND (GEQ s4 1) (GEQ s18 1)), p2:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3742 reset in 183 ms.
Product exploration explored 100000 steps with 3812 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 473 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=4000 ) properties (out of 4) seen :0
Finished Best-First random walk after 84 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 613 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:30:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 11:30:47] [INFO ] Invariant cache hit.
[2023-03-08 11:30:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 11:30:47] [INFO ] Invariant cache hit.
[2023-03-08 11:30:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 469 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=6666 ) properties (out of 4) seen :0
Finished Best-First random walk after 152 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 3700 reset in 107 ms.
Product exploration explored 100000 steps with 3785 reset in 122 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 8 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 11:30:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 11:30:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:30:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 17/21 places, 14/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:30:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:30:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 11:30:49] [INFO ] Invariant cache hit.
[2023-03-08 11:30:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 11:30:49] [INFO ] Invariant cache hit.
[2023-03-08 11:30:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-05 finished in 4489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(!p1) U p2)))'
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:30:49] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 11:30:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 11:30:49] [INFO ] Invariant cache hit.
[2023-03-08 11:30:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-08 11:30:49] [INFO ] Invariant cache hit.
[2023-03-08 11:30:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 207 ms :[p1, true, (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s19 1), p2:(AND (GEQ s5 1) (GEQ s15 1) (GEQ s3 1) (GEQ s14 1)), p0:(AND (LT s19 1) (GEQ s7 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-06 finished in 334 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 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 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 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 15 place count 15 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 4 with 6 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 10 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:30:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:30:49] [INFO ] Implicit Places using invariants in 31 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s1 1) (LT s8 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 2259 reset in 90 ms.
Stack based approach found an accepted trace after 8959 steps with 190 reset with depth 63 and stack size 63 in 10 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-07 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:30:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 11:30:50] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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 43 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s9 1), p1:(OR (LT s7 1) (LT s19 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 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 299 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), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=5714 ) properties (out of 1) seen :0
Finished Best-First random walk after 127 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 12 transition count 8
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 20 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 10 transition count 7
Applied a total of 22 rules in 4 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:30:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 11:30:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 11:30:51] [INFO ] Invariant cache hit.
[2023-03-08 11:30:51] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-08 11:30:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:30:51] [INFO ] Invariant cache hit.
[2023-03-08 11:30:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 10/21 places, 7/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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=5000 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stack based approach found an accepted trace after 152 steps with 0 reset with depth 153 and stack size 153 in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-08 finished in 1740 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)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:30:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:30:51] [INFO ] Implicit Places using invariants in 37 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 42 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s16 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-10 finished in 139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&G(!p2))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:30:51] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:30:51] [INFO ] Implicit Places using invariants in 31 ms returned [14]
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/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 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 35 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (LT s7 1) (LT s20 1)), p0:(OR (LT s19 1) (AND (GEQ s1 1) (GEQ s17 1))), p1:(GEQ s18 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 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 11 factoid took 200 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-11 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:30:52] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 11:30:52] [INFO ] Implicit Places using invariants in 35 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s16 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 13 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-12 finished in 260 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)&&F(G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
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 16 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
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 19 place count 13 transition count 10
Applied a total of 19 rules in 5 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 11:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:30:52] [INFO ] Implicit Places using invariants in 29 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/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 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-08 11:30:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 11:30:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 11:30:52] [INFO ] Invariant cache hit.
[2023-03-08 11:30:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 9/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 1), p1:(AND (LT s8 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stack based approach found an accepted trace after 374 steps with 13 reset with depth 301 and stack size 301 in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-14 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 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 14 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 16 place count 15 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 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.
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 26 place count 10 transition count 6
Applied a total of 26 rules in 33213 ms. Remains 10 /24 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-08 11:31:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants in 33 ms returned [4, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 6/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 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-08 11:31:26] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 11:31:26] [INFO ] Invariant cache hit.
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33312 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-15 finished in 33424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&F((p0&&F(!p1))))||G((F(!p1)&&F(p0)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N5000P0-LTLFireability-04
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 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 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 4 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 11:31:26] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants in 44 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/24 places, 9/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 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:31:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 11:31:26] [INFO ] Invariant cache hit.
[2023-03-08 11:31:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 102 ms. Remains : 10/24 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s8 1)), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-04 finished in 474 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1&&F(p2)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N5000P0-LTLFireability-05
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 13
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 11 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.
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 15 place count 16 transition count 11
Applied a total of 15 rules in 34126 ms. Remains 16 /24 variables (removed 8) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-08 11:32:01] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 11:32:01] [INFO ] Implicit Places using invariants in 46 ms returned [11, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/24 places, 11/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 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Applied a total of 4 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:32:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:32:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 11:32:01] [INFO ] Invariant cache hit.
[2023-03-08 11:32:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/24 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 34266 ms. Remains : 12/24 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LT s10 1), p0:(AND (GEQ s2 1) (GEQ s11 1)), p2:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7333 reset in 97 ms.
Product exploration explored 100000 steps with 7270 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 4) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 431 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:32:03] [INFO ] Invariant cache hit.
[2023-03-08 11:32:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 11:32:03] [INFO ] Invariant cache hit.
[2023-03-08 11:32:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 11:32:03] [INFO ] Invariant cache hit.
[2023-03-08 11:32:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 12/12 places, 9/9 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 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 4) seen :0
Finished Best-First random walk after 19 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 610 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 7229 reset in 145 ms.
Product exploration explored 100000 steps with 7370 reset in 166 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:32:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 12/12 places, 9/9 transitions.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 12/12 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-05 finished in 38625 ms.
[2023-03-08 11:32:05] [INFO ] Flatten gal took : 7 ms
[2023-03-08 11:32:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 11:32:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 1 ms.
Total runtime 103293 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N5000P0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLFireability

FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678275147647

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N5000P0-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N5000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1800 12/32 ClientsAndServers-PT-N5000P0-LTLFireability-05 1728045 m, 345609 m/sec, 4242624 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N5000P0-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N5000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1800 21/32 ClientsAndServers-PT-N5000P0-LTLFireability-05 3119212 m, 278233 m/sec, 8884161 t fired, .

Time elapsed: 10 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N5000P0-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N5000P0-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N5000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1800 29/32 ClientsAndServers-PT-N5000P0-LTLFireability-05 4443029 m, 264763 m/sec, 13340370 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N5000P0-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N5000P0-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N5000P0-LTLFireability-04
lola: time limit : 3580 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N5000P0-LTLFireability-04
lola: result : false
lola: markings : 410053
lola: fired transitions : 410082
lola: time used : 0.000000
lola: memory pages used : 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N5000P0-LTLFireability-02: LTL false LTL model checker
ClientsAndServers-PT-N5000P0-LTLFireability-04: LTL false LTL model checker
ClientsAndServers-PT-N5000P0-LTLFireability-05: LTL unknown AGGR


Time elapsed: 20 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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