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-167814397800324.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-N0200P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397800324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 13:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:21 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-N0200P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678270402684

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-N0200P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 10:13:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 10:13:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:13:26] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-08 10:13:26] [INFO ] Transformed 25 places.
[2023-03-08 10:13:26] [INFO ] Transformed 18 transitions.
[2023-03-08 10:13:26] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 179 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 1 formulas.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 10:13:27] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 10:13:27] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-08 10:13:27] [INFO ] Invariant cache hit.
[2023-03-08 10:13:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 10:13:27] [INFO ] Invariant cache hit.
[2023-03-08 10:13:27] [INFO ] Dead Transitions using invariants and state equation in 98 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 433 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-03-08 10:13:27] [INFO ] Flatten gal took : 33 ms
[2023-03-08 10:13:27] [INFO ] Flatten gal took : 12 ms
[2023-03-08 10:13:27] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 21) seen :7
Finished Best-First random walk after 617 steps, including 0 resets, run visited all 14 properties in 26 ms. (steps per millisecond=23 )
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' '!(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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 11
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 8 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 2 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 2 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
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 25 place count 10 transition count 7
Applied a total of 25 rules in 18 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 10:13:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:13:28] [INFO ] Implicit Places using invariants in 51 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 10:13:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:13:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 10:13:28] [INFO ] Invariant cache hit.
[2023-03-08 10:13:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 388 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 212 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 45 ms :[(NOT p0)]
Finished random walk after 1601 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=800 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 413 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 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:13:30] [INFO ] Invariant cache hit.
[2023-03-08 10:13:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 10:13:30] [INFO ] Invariant cache hit.
[2023-03-08 10:13:30] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 10:13:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:13:30] [INFO ] Invariant cache hit.
[2023-03-08 10:13:30] [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 173 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 51 ms :[(NOT p0)]
Finished random walk after 1601 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=800 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 272 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 309 ms.
Product exploration explored 100000 steps with 0 reset in 270 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 22 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:13:32] [INFO ] Invariant cache hit.
[2023-03-08 10:13:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 10:13:32] [INFO ] Invariant cache hit.
[2023-03-08 10:13:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 10:13:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:13:32] [INFO ] Invariant cache hit.
[2023-03-08 10:13:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-00 finished in 3969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||(G(p2) U X(p3))))'
Support contains 5 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 10:13:32] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 10:13:32] [INFO ] Implicit Places using invariants in 63 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 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 4 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 72 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 699 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 7}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p2:(GEQ s12 1), p3:(GEQ s17 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 717 reset in 375 ms.
Stack based approach found an accepted trace after 77335 steps with 557 reset with depth 104 and stack size 104 in 316 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-01 finished in 1512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(p2)&&p1)))))'
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 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.
[2023-03-08 10:13:34] [INFO ] Invariant cache hit.
[2023-03-08 10:13:34] [INFO ] Implicit Places using invariants in 81 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 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 88 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s6 1), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2219 reset in 202 ms.
Product exploration explored 100000 steps with 2221 reset in 682 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) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 629 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 4) seen :1
Finished Best-First random walk after 8259 steps, including 2 resets, run visited all 3 properties in 56 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 715 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:13:37] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 10:13:37] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 10:13:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:13:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 10:13:37] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 10:13:37] [INFO ] Added : 15 causal constraints over 3 iterations in 47 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-08 10:13:37] [INFO ] Invariant cache hit.
[2023-03-08 10:13:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 10:13:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:13:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-08 10:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 10:13:37] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:13:37] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (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.
[2023-03-08 10:13:37] [INFO ] Invariant cache hit.
[2023-03-08 10:13:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 10:13:37] [INFO ] Invariant cache hit.
[2023-03-08 10:13:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 10:13:37] [INFO ] Invariant cache hit.
[2023-03-08 10:13:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 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 p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 619 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 4) seen :1
Finished Best-First random walk after 4356 steps, including 1 resets, run visited all 3 properties in 15 ms. (steps per millisecond=290 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 709 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-08 10:13:39] [INFO ] Invariant cache hit.
[2023-03-08 10:13:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 10:13:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:13:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-08 10:13:39] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 10:13:39] [INFO ] Added : 15 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-08 10:13:39] [INFO ] Invariant cache hit.
[2023-03-08 10:13:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 10:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:13:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 10:13:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:13:40] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2226 reset in 204 ms.
Product exploration explored 100000 steps with 2196 reset in 221 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:13:40] [INFO ] Invariant cache hit.
[2023-03-08 10:13:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 10:13:41] [INFO ] Invariant cache hit.
[2023-03-08 10:13:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 10:13:41] [INFO ] Invariant cache hit.
[2023-03-08 10:13:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-02 finished in 7122 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((G(F(!p1))||(F(!p1)&&X(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 2 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 10:13:41] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 10:13:41] [INFO ] Implicit Places using invariants in 45 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 51 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (AND (NOT p2) p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(AND (GEQ s5 1) (GEQ s14 1)), p2:(OR (AND (GEQ s7 1) (GEQ s19 1)) (AND (GEQ s5 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3642 reset in 177 ms.
Product exploration explored 100000 steps with 3694 reset in 193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 440 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), p1]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:13:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:13:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-03 finished in 1908 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||(!p1&&X(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 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 2 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 10:13:43] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 10:13:43] [INFO ] Implicit Places using invariants in 52 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 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 60 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, p0, p0, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(LT s16 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-04 finished in 255 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&&X(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 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 2 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 10:13:43] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 10:13:43] [INFO ] Implicit Places using invariants in 44 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 50 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s11 1) (LT s16 1)), p0:(GEQ s19 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-05 finished in 263 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)||(p1 U !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 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 10:13:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 10:13:43] [INFO ] Implicit Places using invariants in 198 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 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 204 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s14 1)), p1:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-06 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p0))||F(p1)))))'
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 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 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:13:43] [INFO ] Invariant cache hit.
[2023-03-08 10:13:44] [INFO ] Implicit Places using invariants in 46 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 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 7 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 60 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (GEQ s9 1) (AND (GEQ s0 1) (GEQ s13 1)) (GEQ s9 1)), p0:(GEQ s12 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 10149 reset in 288 ms.
Product exploration explored 100000 steps with 10244 reset in 385 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 (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 3205 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1602 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 10:13:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:13:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 10:13:46] [INFO ] Invariant cache hit.
[2023-03-08 10:13:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 10:13:46] [INFO ] Invariant cache hit.
[2023-03-08 10:13:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 3205 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1068 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 10160 reset in 192 ms.
Product exploration explored 100000 steps with 10226 reset in 219 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 19 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 19 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 19 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 15
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 15 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-08 10:13:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2023-03-08 10:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:13:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 17/20 places, 15/18 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 10:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 10:13:48] [INFO ] Invariant cache hit.
[2023-03-08 10:13:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-07 finished in 4944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||F(p1)))) U G(!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 2 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 10:13:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:13:48] [INFO ] Implicit Places using invariants in 51 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 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 2 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 56 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 271 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) p2 p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s7 1) (LT s19 1)), p0:(GEQ s18 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33216 reset in 153 ms.
Product exploration explored 100000 steps with 33490 reset in 179 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 843 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:13:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:13:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:50] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 10:13:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:13:51] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 10:13:51] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:13:51] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 90 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 935 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 254 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
[2023-03-08 10:13:52] [INFO ] Invariant cache hit.
[2023-03-08 10:13:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 10:13:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 10:13:52] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG 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.
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.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 14 transition count 11
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 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 2 with 2 rules applied. Total rules applied 16 place count 13 transition count 10
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 11 transition count 8
Applied a total of 20 rules in 4 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 10:13:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:13:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 10:13:52] [INFO ] Invariant cache hit.
[2023-03-08 10:13:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 10:13:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:13:52] [INFO ] Invariant cache hit.
[2023-03-08 10:13:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 11/21 places, 8/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 p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 846 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Finished Best-First random walk after 171 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 13 factoid took 892 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 241 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
[2023-03-08 10:13:55] [INFO ] Invariant cache hit.
[2023-03-08 10:13:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:13:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 10:13:55] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:13:55] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 217 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 28777 reset in 197 ms.
Stack based approach found an accepted trace after 4725 steps with 1387 reset with depth 15 and stack size 15 in 19 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-09 finished in 7403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((!p0&&X(!p0)))) U G((p1 U p2))))'
Support contains 5 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 2 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 10:13:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:13:56] [INFO ] Implicit Places using invariants in 50 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 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 55 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), p0, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s16 1) (GEQ s0 1) (GEQ s13 1)), p1:(GEQ s19 1), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39752 reset in 354 ms.
Product exploration explored 100000 steps with 39741 reset in 312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 976 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), p0, (OR (AND p0 p1) (AND p0 p2)), p0, (NOT p2)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 8) seen :3
Finished Best-First random walk after 58 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (AND p0 p1) (AND p0 p2))), (F p0), (F (OR p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 1361 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), p0, (OR (AND p0 p1) (AND p0 p2)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), p0, (OR (AND p0 p1) (AND p0 p2)), p0, (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:14:00] [INFO ] Computed 4 place invariants in 1 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (AND p0 p1) (AND p0 p2))), (F p0), (F (OR p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 17 factoid took 637 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-10 finished in 4893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0) U X(!p1))) U (p0 U 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 2 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 10:14:01] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:14:01] [INFO ] Implicit Places using invariants in 59 ms returned [14, 19]
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 64 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s18 1), p0:(GEQ s6 1), p1:(OR (LT s7 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2478 reset in 171 ms.
Product exploration explored 100000 steps with 2414 reset in 210 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3339 ) properties (out of 6) seen :0
Finished Best-First random walk after 527 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=263 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0), (F p2), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 276 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:14:03] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 10:14:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 10:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 10:14:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:14:03] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:14:03] [INFO ] Invariant cache hit.
[2023-03-08 10:14:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 10:14:03] [INFO ] Invariant cache hit.
[2023-03-08 10:14:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 10:14:04] [INFO ] Invariant cache hit.
[2023-03-08 10:14:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 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 p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 6) seen :0
Finished Best-First random walk after 781 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=260 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0), (F p2), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 431 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
[2023-03-08 10:14:06] [INFO ] Invariant cache hit.
[2023-03-08 10:14:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 10:14:06] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:14:06] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 2459 reset in 163 ms.
Product exploration explored 100000 steps with 2439 reset in 199 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
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 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 17 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 17 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 17 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 23 rules in 10 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-08 10:14:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2023-03-08 10:14:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:14:07] [INFO ] Dead Transitions using invariants and state equation in 37 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 56 ms. Remains : 15/21 places, 12/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 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 10:14:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:14:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 10:14:07] [INFO ] Invariant cache hit.
[2023-03-08 10:14:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 10:14:07] [INFO ] Invariant cache hit.
[2023-03-08 10:14:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-11 finished in 6480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 9 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-08 10:14:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:14:07] [INFO ] Implicit Places using invariants in 42 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
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 4 place count 7 transition count 5
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 10:14:07] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:14:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 10:14:07] [INFO ] Invariant cache hit.
[2023-03-08 10:14:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[p0]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-12 finished in 336 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(G(p1))||p0)))'
Support contains 5 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 10:14:08] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 10:14:08] [INFO ] Implicit Places using invariants in 43 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 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 48 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-13 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:(OR (GEQ s16 1) (GEQ s12 1) (GEQ s9 1)), p1:(AND (GEQ s12 1) (GEQ s7 1) (GEQ 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 312 ms.
Product exploration explored 100000 steps with 0 reset in 364 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 173 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 49 ms :[(NOT p1)]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3342 ) properties (out of 1) seen :0
Finished Best-First random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 176 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 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:14:09] [INFO ] Computed 4 place invariants in 1 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-13 finished in 1576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||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 1 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 10:14:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:14:09] [INFO ] Implicit Places using invariants in 48 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 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 52 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GEQ s19 1), p0:(AND (GEQ s12 1) (GEQ s6 1) (GEQ s19 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-14 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0&&F(p1)&&X(p2))))))'
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.
[2023-03-08 10:14:09] [INFO ] Invariant cache hit.
[2023-03-08 10:14:10] [INFO ] Implicit Places using invariants in 52 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(GEQ s17 1), p1:(GEQ s18 1), p2:(GEQ s12 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-15 finished in 542 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(p2)&&p1)))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0200P0-LTLFireability-02
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_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.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 19 transition count 12
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 14 place count 16 transition count 12
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 18 place count 14 transition count 10
Applied a total of 18 rules in 6 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 10:14:11] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 10:14:11] [INFO ] Implicit Places using invariants in 73 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 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 11 transition count 8
Applied a total of 4 rules in 2 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 10:14:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:14:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 10:14:11] [INFO ] Invariant cache hit.
[2023-03-08 10:14:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/24 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 224 ms. Remains : 11/24 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s9 1)), p0:(GEQ s4 1), p2:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7432 reset in 165 ms.
Product exploration explored 100000 steps with 7517 reset in 198 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) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 599 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 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))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10026 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1114 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Finished Best-First random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 671 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-08 10:14:13] [INFO ] Invariant cache hit.
[2023-03-08 10:14:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:14:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 10:14:13] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:14:13] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-08 10:14:13] [INFO ] Invariant cache hit.
[2023-03-08 10:14:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:14:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 10:14:13] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:14:13] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 10:14:13] [INFO ] Invariant cache hit.
[2023-03-08 10:14:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 10:14:13] [INFO ] Invariant cache hit.
[2023-03-08 10:14:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 10:14:13] [INFO ] Invariant cache hit.
[2023-03-08 10:14:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 546 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3342 ) properties (out of 4) seen :1
Finished Best-First random walk after 3526 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1175 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 580 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-08 10:14:15] [INFO ] Invariant cache hit.
[2023-03-08 10:14:15] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 10:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:14:15] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:14:15] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-08 10:14:15] [INFO ] Invariant cache hit.
[2023-03-08 10:14:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 10:14:15] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:14:15] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7449 reset in 98 ms.
Product exploration explored 100000 steps with 7424 reset in 109 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 10:14:16] [INFO ] Invariant cache hit.
[2023-03-08 10:14:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 10:14:16] [INFO ] Invariant cache hit.
[2023-03-08 10:14:16] [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.
[2023-03-08 10:14:16] [INFO ] Invariant cache hit.
[2023-03-08 10:14:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-02 finished in 5584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p0))||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0) U X(!p1))) U (p0 U p2)))))'
[2023-03-08 10:14:16] [INFO ] Flatten gal took : 8 ms
[2023-03-08 10:14:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 10:14:16] [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 50057 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0200P0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

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

FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678270488035

--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0200P0-LTLFireability-02
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N0200P0-LTLFireability-02
lola: result : false
lola: markings : 11201
lola: fired transitions : 11201
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0200P0-LTLFireability-11
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0200P0-LTLFireability-02: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1200 13/32 ClientsAndServers-PT-N0200P0-LTLFireability-11 1855816 m, 371163 m/sec, 5011366 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1200 25/32 ClientsAndServers-PT-N0200P0-LTLFireability-11 3771138 m, 383064 m/sec, 10343909 t fired, .

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

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

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0200P0-LTLFireability-07
lola: time limit : 1792 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0200P0-LTLFireability-02: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1792 13/32 ClientsAndServers-PT-N0200P0-LTLFireability-07 2003894 m, 400778 m/sec, 3906643 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1792 27/32 ClientsAndServers-PT-N0200P0-LTLFireability-07 4121640 m, 423549 m/sec, 8098854 t fired, .

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

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

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

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0200P0-LTLFireability-00
lola: time limit : 3570 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0200P0-LTLFireability-00
lola: result : false
lola: markings : 12802
lola: fired transitions : 12803
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0200P0-LTLFireability-00: LTL false LTL model checker
ClientsAndServers-PT-N0200P0-LTLFireability-02: LTL false LTL model checker
ClientsAndServers-PT-N0200P0-LTLFireability-07: LTL unknown AGGR
ClientsAndServers-PT-N0200P0-LTLFireability-11: LTL unknown AGGR


Time elapsed: 30 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-N0200P0"
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-N0200P0, 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-167814397800324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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