Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 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-N0020P2-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678366849184

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 13:00:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 13:00:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:00:52] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-09 13:00:52] [INFO ] Transformed 25 places.
[2023-03-09 13:00:52] [INFO ] Transformed 18 transitions.
[2023-03-09 13:00:52] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-15 TRUE 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 15 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-09 13:00:52] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-09 13:00:52] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-09 13:00:52] [INFO ] Invariant cache hit.
[2023-03-09 13:00:52] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-09 13:00:52] [INFO ] Invariant cache hit.
[2023-03-09 13:00:52] [INFO ] Dead Transitions using invariants and state equation in 67 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 365 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-03-09 13:00:53] [INFO ] Flatten gal took : 24 ms
[2023-03-09 13:00:53] [INFO ] Flatten gal took : 8 ms
[2023-03-09 13:00:53] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4682 steps, including 2 resets, run visited all 20 properties in 67 ms. (steps per millisecond=69 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p0))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 13:00:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:00:53] [INFO ] Implicit Places using invariants in 42 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 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 47 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 275 ms :[p0, p0, p0, true]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 5 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-00 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' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 4 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 24 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-09 13:00:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:00:54] [INFO ] Implicit Places using invariants in 37 ms returned [11, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 11/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
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 12 transition count 9
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 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Applied a total of 6 rules in 3 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-09 13:00:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 13:00:54] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 96 ms. Remains : 9/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s3 1) (GEQ s8 1)), p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9848 steps with 0 reset in 70 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-01 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G((p0 U X(p1)))) U p2) U p3)))'
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-09 13:00:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 13:00:54] [INFO ] Implicit Places using invariants in 43 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/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 301 ms :[(NOT p3), (NOT p3), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (GEQ s9 1) (AND (GEQ s11 1) (GEQ s16 1))), p2:(AND (GEQ s11 1) (GEQ s16 1) (GEQ s20 1)), p0:(AND (GEQ s11 1) (GEQ s16 1)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-02 finished in 382 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 U ((X(p0) U G(p0))||G(!p0)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 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-09 13:00:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:00:54] [INFO ] Implicit Places using invariants in 42 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 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 45 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), false, false]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-03 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(((p2&&G(p3))||p1)))))))'
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-09 13:00:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 13:00:55] [INFO ] Implicit Places using invariants in 42 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 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 47 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p1:(OR (LT s0 1) (LT s13 1)), p2:(LT s16 1), p3:(OR (LT s7 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 144 steps with 24 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-04 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 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-09 13:00:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:00:55] [INFO ] Implicit Places using invariants in 38 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 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 41 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-05 finished in 138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 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-09 13:00:55] [INFO ] Invariant cache hit.
[2023-03-09 13:00:55] [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 : 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 48 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1506 reset in 230 ms.
Product exploration explored 100000 steps with 1517 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 654 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=327 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 13:00:56] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 13:00:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 13:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 13:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:00:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 13:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 13:00:56] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 13:00:56] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 11 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 13:00:56] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 13:00:56] [INFO ] Implicit Places using invariants in 28 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 6/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 13:00:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 13:00:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 13:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:00:57] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 13:00:57] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10165 reset in 121 ms.
Product exploration explored 100000 steps with 10257 reset in 88 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:00:57] [INFO ] Invariant cache hit.
[2023-03-09 13:00:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 13:00:57] [INFO ] Invariant cache hit.
[2023-03-09 13:00:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-09 13:00:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:00:57] [INFO ] Invariant cache hit.
[2023-03-09 13:00:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-06 finished in 2111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 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-09 13:00:57] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:00:57] [INFO ] Implicit Places using invariants in 50 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 : 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 54 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ 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][false, false]]
Product exploration explored 100000 steps with 1215 reset in 102 ms.
Product exploration explored 100000 steps with 1240 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 3455 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=691 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 13:00:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 13:00:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 13:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:00:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 13:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:58] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 13:00:58] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 13:00:58] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 11 transition count 6
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 24 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 4 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 13:00:58] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 13:00:58] [INFO ] Implicit Places using invariants in 28 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 6/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 13:00:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 13:00:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 13:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:00:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 13:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:00:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:00:59] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:00:59] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10279 reset in 73 ms.
Product exploration explored 100000 steps with 10295 reset in 83 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:00:59] [INFO ] Invariant cache hit.
[2023-03-09 13:00:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 13:00:59] [INFO ] Invariant cache hit.
[2023-03-09 13:00:59] [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-09 13:00:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:00:59] [INFO ] Invariant cache hit.
[2023-03-09 13:00:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-07 finished in 1765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((X(p2)||p1))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 13:00:59] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 13:00:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 13:00:59] [INFO ] Invariant cache hit.
[2023-03-09 13:00:59] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 13:00:59] [INFO ] Invariant cache hit.
[2023-03-09 13:00:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 23/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(OR (LT s7 1) (LT s21 1)), p2:(OR (LT s4 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13858 reset in 86 ms.
Product exploration explored 100000 steps with 14002 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 786 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 491 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-09 13:01:01] [INFO ] Invariant cache hit.
[2023-03-09 13:01:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:01] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 13:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:01] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 13:01:01] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 13:01:01] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:01] [INFO ] Invariant cache hit.
[2023-03-09 13:01:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 13:01:01] [INFO ] Invariant cache hit.
[2023-03-09 13:01:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-09 13:01:01] [INFO ] Invariant cache hit.
[2023-03-09 13:01:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 23/23 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1182 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=295 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-09 13:01:02] [INFO ] Invariant cache hit.
[2023-03-09 13:01:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 13:01:02] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 13:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:03] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 13:01:03] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 13:01:03] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13873 reset in 84 ms.
Product exploration explored 100000 steps with 13885 reset in 99 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 23 transition count 18
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 23 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 5 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 13:01:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 13:01:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/23 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 23/23 places, 18/18 transitions.
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 13:01:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 13:01:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 13:01:03] [INFO ] Invariant cache hit.
[2023-03-09 13:01:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 13:01:03] [INFO ] Invariant cache hit.
[2023-03-09 13:01:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 23/23 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-08 finished in 4652 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((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(!p2&&((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(p1)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 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-09 13:01:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 13:01:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 13:01:04] [INFO ] Invariant cache hit.
[2023-03-09 13:01:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-09 13:01:04] [INFO ] Invariant cache hit.
[2023-03-09 13:01:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, (AND p2 p0 (NOT p1)), p0, (AND p0 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s19 1) (GEQ s3 1) (GEQ s14 1)), p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33208 reset in 149 ms.
Product exploration explored 100000 steps with 33250 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1211 ms. Reduced automaton from 4 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p0, (AND p0 p2 (NOT p1)), p0, (AND p0 p2)]
Incomplete random walk after 10038 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=386 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:01:06] [INFO ] Invariant cache hit.
[2023-03-09 13:01:06] [INFO ] After 20ms 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F p0), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 24 factoid took 1497 ms. Reduced automaton from 4 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 176 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:07] [INFO ] Invariant cache hit.
[2023-03-09 13:01:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 13:01:08] [INFO ] Invariant cache hit.
[2023-03-09 13:01:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 13:01:08] [INFO ] Invariant cache hit.
[2023-03-09 13:01:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 22/22 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) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 944 ms. Reduced automaton from 4 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Incomplete random walk after 10020 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 8) seen :7
Finished Best-First random walk after 538 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=269 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 17 factoid took 1068 ms. Reduced automaton from 4 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 172 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 169 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Product exploration explored 100000 steps with 33239 reset in 151 ms.
Product exploration explored 100000 steps with 33174 reset in 159 ms.
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:11] [INFO ] Invariant cache hit.
[2023-03-09 13:01:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 13:01:11] [INFO ] Invariant cache hit.
[2023-03-09 13:01:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 13:01:11] [INFO ] Invariant cache hit.
[2023-03-09 13:01:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-09 finished in 7346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U !p1) U X((!p2||G(p3)||F(!p4)))))'
Support contains 8 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-09 13:01:11] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 13:01:11] [INFO ] Implicit Places using invariants in 34 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 37 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3) p4), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 p4), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0 p2 p4), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2 p3 p4) (AND (NOT p0) p2 p3 p4)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p2 (NOT p3) p4) (AND (NOT p0) p2 (NOT p3) p4)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2 p4), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0 p2 (NOT p3) p4), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 p2 p3 p4), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) p2 (NOT p3) p4), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0) p2 p3 p4), acceptance={} source=3 dest: 7}], [{ cond=p4, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p4), acceptance={} source=5 dest: 4}, { cond=(AND p3 p4), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 p0 p4), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0) p4), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p0 (NOT p3) p4), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0 p3 p4), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) p4), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0) p3 p4), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LT s10 1), p0:(OR (AND (GEQ s0 1) (GEQ s13 1)) (GEQ s10 1)), p2:(OR (LT s7 1) (LT s19 1)), p3:(AND (GEQ s5 1) (GEQ s14 1)), p4:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4529 reset in 121 ms.
Product exploration explored 100000 steps with 4486 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 (NOT p3) p4), (X (NOT (AND p1 p0 p2 p4))), (X (OR (AND (NOT p1) p2 (NOT p3) p4) (AND (NOT p0) p2 (NOT p3) p4))), (X (NOT (AND p1 p0 p2 p3 p4))), (X (AND p1 (NOT p0) p2 (NOT p3) p4)), (X (NOT (AND p2 p3 p4))), (X (NOT (AND p1 (NOT p0) p2 p3 p4))), (X (AND p1 (NOT p0) p2 p4)), (X (NOT (AND p1 p0 p2 (NOT p3) p4))), (X (AND p2 (NOT p3) p4)), (X (NOT (OR (AND (NOT p1) p2 p3 p4) (AND (NOT p0) p2 p3 p4)))), (X (X p4)), (X (X (AND p1 (NOT p0) p4))), (X (X (NOT (AND p1 (NOT p0) p2 p3 p4)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND p1 p0 p4)))), (X (X (NOT (AND p1 p0 p2 p4)))), (X (X (OR (AND (NOT p1) p2 (NOT p3) p4) (AND (NOT p0) p2 (NOT p3) p4)))), (X (X (NOT (AND p1 p0 p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p0) p3 p4)))), (X (X (AND p1 (NOT p0) p2 (NOT p3) p4))), (X (X (NOT (AND p1 p0 (NOT p3) p4)))), (X (X (NOT (AND p2 p3 p4)))), (X (X (NOT (AND p3 p4)))), (X (X (AND p1 (NOT p0) p2 p4))), (X (X (NOT (AND p1 p0 p2 (NOT p3) p4)))), (X (X (AND p2 (NOT p3) p4))), (X (X (NOT (OR (AND (NOT p1) p2 p3 p4) (AND (NOT p0) p2 p3 p4))))), (X (X (NOT (AND p1 p0 p3 p4)))), (X (X (AND p1 (NOT p0) (NOT p3) p4)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 1739 ms. Reduced automaton from 8 states, 22 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Incomplete random walk after 10009 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 19) seen :17
Finished Best-First random walk after 2348 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND p1 (NOT p0) p2 (NOT p3) p4), (X (NOT (AND p1 p0 p2 p4))), (X (OR (AND (NOT p1) p2 (NOT p3) p4) (AND (NOT p0) p2 (NOT p3) p4))), (X (NOT (AND p1 p0 p2 p3 p4))), (X (AND p1 (NOT p0) p2 (NOT p3) p4)), (X (NOT (AND p2 p3 p4))), (X (NOT (AND p1 (NOT p0) p2 p3 p4))), (X (AND p1 (NOT p0) p2 p4)), (X (NOT (AND p1 p0 p2 (NOT p3) p4))), (X (AND p2 (NOT p3) p4)), (X (NOT (OR (AND (NOT p1) p2 p3 p4) (AND (NOT p0) p2 p3 p4)))), (X (X p4)), (X (X (AND p1 (NOT p0) p4))), (X (X (NOT (AND p1 (NOT p0) p2 p3 p4)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND p1 p0 p4)))), (X (X (NOT (AND p1 p0 p2 p4)))), (X (X (OR (AND (NOT p1) p2 (NOT p3) p4) (AND (NOT p0) p2 (NOT p3) p4)))), (X (X (NOT (AND p1 p0 p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p0) p3 p4)))), (X (X (AND p1 (NOT p0) p2 (NOT p3) p4))), (X (X (NOT (AND p1 p0 (NOT p3) p4)))), (X (X (NOT (AND p2 p3 p4)))), (X (X (NOT (AND p3 p4)))), (X (X (AND p1 (NOT p0) p2 p4))), (X (X (NOT (AND p1 p0 p2 (NOT p3) p4)))), (X (X (AND p2 (NOT p3) p4))), (X (X (NOT (OR (AND (NOT p1) p2 p3 p4) (AND (NOT p0) p2 p3 p4))))), (X (X (NOT (AND p1 p0 p3 p4)))), (X (X (AND p1 (NOT p0) (NOT p3) p4)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p3) (NOT p0) p4 p2))), (F (AND p1 p3 p0 p4 p2)), (F (AND p1 p3 (NOT p0) p4 p2)), (F (AND p1 (NOT p3) p0 p4)), (F (NOT (OR (AND (NOT p1) (NOT p3) p4 p2) (AND (NOT p3) (NOT p0) p4 p2)))), (F (NOT (AND p1 (NOT p0) p4))), (F (OR (AND (NOT p1) p3 p4 p2) (AND p3 (NOT p0) p4 p2))), (F (AND p1 p0 p4)), (F (AND p1 (NOT p3) p0 p4 p2)), (F (AND p3 p4)), (F (NOT (AND p1 (NOT p0) p4 p2))), (F (NOT (AND (NOT p3) p4 p2))), (F (AND p1 p3 (NOT p0) p4)), (F (NOT (AND p1 (NOT p3) (NOT p0) p4))), (F (AND p1 p0 p4 p2)), (F (AND p3 p4 p2)), (F (AND p1 p3 p0 p4)), (F (NOT (AND (NOT p3) p4))), (F (NOT p4))]
Knowledge based reduction with 30 factoid took 2105 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Stuttering acceptance computed with spot in 342 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 13:01:17] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 13:01:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 13:01:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 13:01:17] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 13:01:17] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (AND p2 (NOT p3) p4)
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:17] [INFO ] Invariant cache hit.
[2023-03-09 13:01:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 13:01:17] [INFO ] Invariant cache hit.
[2023-03-09 13:01:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-09 13:01:17] [INFO ] Invariant cache hit.
[2023-03-09 13:01:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 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 p3) p4 p2 p1 (NOT p0)), (X (AND p1 (NOT p3) (NOT p0) p4 p2)), (X (NOT (AND p1 p0 p4 p2))), (X (NOT (OR (AND (NOT p1) p3 p4 p2) (AND p3 (NOT p0) p4 p2)))), (X (NOT (AND p1 (NOT p3) p0 p4 p2))), (X (NOT (AND p1 p3 (NOT p0) p4 p2))), (X (NOT (AND p1 p3 p0 p4 p2))), (X (OR (AND (NOT p1) (NOT p3) p4 p2) (AND (NOT p3) (NOT p0) p4 p2))), (X (AND p1 (NOT p0) p4 p2)), (X (X (NOT (AND p1 (NOT p3) p0 p4)))), (X (X p4)), (X (X (AND p1 (NOT p3) (NOT p0) p4 p2))), (X (X (AND p1 (NOT p0) p4))), (X (X (NOT (AND p1 p3 p0 p4)))), (X (X (NOT (AND p3 p4 p2)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND p1 p3 p0 p4 p2)))), (X (X (NOT (AND p1 p0 p4)))), (X (X (AND p1 (NOT p0) p4 p2))), (X (X (AND p1 (NOT p3) (NOT p0) p4))), (X (X (NOT (AND p1 p0 p4 p2)))), (X (X (NOT (OR (AND (NOT p1) p3 p4 p2) (AND p3 (NOT p0) p4 p2))))), (X (X (NOT (AND p1 (NOT p3) p0 p4 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p4 p2)))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND p1 p3 (NOT p0) p4)))), (X (X (AND (NOT p3) p4 p2))), (X (X (OR (AND (NOT p1) (NOT p3) p4 p2) (AND (NOT p3) (NOT p0) p4 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 1699 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Finished random walk after 2881 steps, including 0 resets, run visited all 19 properties in 8 ms. (steps per millisecond=360 )
Knowledge obtained : [(AND (NOT p3) p4 p2 p1 (NOT p0)), (X (AND p1 (NOT p3) (NOT p0) p4 p2)), (X (NOT (AND p1 p0 p4 p2))), (X (NOT (OR (AND (NOT p1) p3 p4 p2) (AND p3 (NOT p0) p4 p2)))), (X (NOT (AND p1 (NOT p3) p0 p4 p2))), (X (NOT (AND p1 p3 (NOT p0) p4 p2))), (X (NOT (AND p1 p3 p0 p4 p2))), (X (OR (AND (NOT p1) (NOT p3) p4 p2) (AND (NOT p3) (NOT p0) p4 p2))), (X (AND p1 (NOT p0) p4 p2)), (X (X (NOT (AND p1 (NOT p3) p0 p4)))), (X (X p4)), (X (X (AND p1 (NOT p3) (NOT p0) p4 p2))), (X (X (AND p1 (NOT p0) p4))), (X (X (NOT (AND p1 p3 p0 p4)))), (X (X (NOT (AND p3 p4 p2)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND p1 p3 p0 p4 p2)))), (X (X (NOT (AND p1 p0 p4)))), (X (X (AND p1 (NOT p0) p4 p2))), (X (X (AND p1 (NOT p3) (NOT p0) p4))), (X (X (NOT (AND p1 p0 p4 p2)))), (X (X (NOT (OR (AND (NOT p1) p3 p4 p2) (AND p3 (NOT p0) p4 p2))))), (X (X (NOT (AND p1 (NOT p3) p0 p4 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p4 p2)))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND p1 p3 (NOT p0) p4)))), (X (X (AND (NOT p3) p4 p2))), (X (X (OR (AND (NOT p1) (NOT p3) p4 p2) (AND (NOT p3) (NOT p0) p4 p2))))]
False Knowledge obtained : [(F (NOT (AND p1 p2 (NOT p0) (NOT p3) p4))), (F (AND p1 p2 p0 p3 p4)), (F (AND p1 p2 (NOT p0) p3 p4)), (F (AND p1 p0 (NOT p3) p4)), (F (NOT (OR (AND (NOT p1) p2 (NOT p3) p4) (AND p2 (NOT p0) (NOT p3) p4)))), (F (NOT (AND p1 (NOT p0) p4))), (F (OR (AND (NOT p1) p2 p3 p4) (AND p2 (NOT p0) p3 p4))), (F (AND p1 p0 p4)), (F (AND p1 p2 p0 (NOT p3) p4)), (F (AND p3 p4)), (F (NOT (AND p1 p2 (NOT p0) p4))), (F (NOT (AND p2 (NOT p3) p4))), (F (AND p1 (NOT p0) p3 p4)), (F (NOT (AND p1 (NOT p0) (NOT p3) p4))), (F (AND p1 p2 p0 p4)), (F (AND p1 p0 p3 p4)), (F (AND p2 p3 p4)), (F (NOT (AND (NOT p3) p4))), (F (NOT p4))]
Knowledge based reduction with 28 factoid took 1989 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Stuttering acceptance computed with spot in 353 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
[2023-03-09 13:01:22] [INFO ] Invariant cache hit.
[2023-03-09 13:01:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 13:01:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 13:01:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 13:01:22] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND p2 (NOT p3) p4)
Stuttering acceptance computed with spot in 360 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Product exploration explored 100000 steps with 4546 reset in 120 ms.
Product exploration explored 100000 steps with 4553 reset in 137 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 394 ms :[(AND p2 (NOT p3) p4), (AND p4 (NOT p3) p2), (AND p2 (NOT p3) p4), (AND p1 p2 (NOT p3) p4), p4, (AND p4 (NOT p3)), (AND p1 p4), (AND p1 (NOT p3) p4)]
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 8 rules in 7 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-09 13:01:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2023-03-09 13:01:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 13:01:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 20/21 places, 17/18 transitions.
Support contains 8 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-09 13:01:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 13:01:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 13:01:23] [INFO ] Invariant cache hit.
[2023-03-09 13:01:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-09 13:01:23] [INFO ] Invariant cache hit.
[2023-03-09 13:01:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-10 finished in 12006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((!p1&&F(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 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-09 13:01:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:01:23] [INFO ] Implicit Places using invariants in 29 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ 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]]
Product exploration explored 100000 steps with 1939 reset in 105 ms.
Product exploration explored 100000 steps with 1931 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 380 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 1142 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=380 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 433 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 13:01:24] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 13:01:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 13:01:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 13:01:25] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 13:01:25] [INFO ] Invariant cache hit.
[2023-03-09 13:01:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 13:01:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 13:01:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 13:01:25] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 13:01:25] [INFO ] Invariant cache hit.
[2023-03-09 13:01:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 13:01:25] [INFO ] Invariant cache hit.
[2023-03-09 13:01:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-09 13:01:25] [INFO ] Invariant cache hit.
[2023-03-09 13:01:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 900 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=450 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
[2023-03-09 13:01:26] [INFO ] Invariant cache hit.
[2023-03-09 13:01:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 13:01:26] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 13:01:26] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 13:01:26] [INFO ] Invariant cache hit.
[2023-03-09 13:01:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 13:01:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-09 13:01:26] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 13:01:26] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 1941 reset in 104 ms.
Product exploration explored 100000 steps with 1934 reset in 121 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 20 transition count 17
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 20 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-09 13:01:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2023-03-09 13:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 13:01:26] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 20/21 places, 17/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 13:01:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 13:01:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 13:01:26] [INFO ] Invariant cache hit.
[2023-03-09 13:01:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 13:01:26] [INFO ] Invariant cache hit.
[2023-03-09 13:01:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-11 finished in 3629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 5 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 6 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-09 13:01:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:01:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 13:01:27] [INFO ] Invariant cache hit.
[2023-03-09 13:01:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-09 13:01:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:27] [INFO ] Invariant cache hit.
[2023-03-09 13:01:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/24 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 15/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p1) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s8 1), p0:(AND (GEQ s2 1) (GEQ s10 1)), p2:(OR (LT s4 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-12 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
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 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 3 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 13:01:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 13:01:27] [INFO ] Implicit Places using invariants in 26 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 4
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-09 13:01:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 13:01:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 13:01:27] [INFO ] Invariant cache hit.
[2023-03-09 13:01:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11691 reset in 55 ms.
Product exploration explored 100000 steps with 12295 reset in 190 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
[2023-03-09 13:01:28] [INFO ] Invariant cache hit.
[2023-03-09 13:01:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:28] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:28] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-09 13:01:28] [INFO ] Invariant cache hit.
[2023-03-09 13:01:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 13:01:28] [INFO ] Invariant cache hit.
[2023-03-09 13:01:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-09 13:01:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:28] [INFO ] Invariant cache hit.
[2023-03-09 13:01:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 5/5 places, 4/4 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
[2023-03-09 13:01:28] [INFO ] Invariant cache hit.
[2023-03-09 13:01:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 13:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:01:28] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:28] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Product exploration explored 100000 steps with 12590 reset in 66 ms.
Product exploration explored 100000 steps with 13824 reset in 123 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-09 13:01:29] [INFO ] Invariant cache hit.
[2023-03-09 13:01:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 13:01:29] [INFO ] Invariant cache hit.
[2023-03-09 13:01:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-09 13:01:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:29] [INFO ] Invariant cache hit.
[2023-03-09 13:01:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-13 finished in 2024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X(X(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-09 13:01:29] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:01:29] [INFO ] Implicit Places using invariants in 31 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 37 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(LT 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-14 finished in 216 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)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P2-LTLFireability-06
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 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 22 place count 12 transition count 8
Applied a total of 22 rules in 6 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 13:01:29] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:01:29] [INFO ] Implicit Places using invariants in 33 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 4 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 13:01:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 13:01:29] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 73 ms. Remains : 6/24 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10246 reset in 67 ms.
Product exploration explored 100000 steps with 10201 reset in 84 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 13:01:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 13:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 13:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 13:01:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:30] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:30] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:01:30] [INFO ] Invariant cache hit.
[2023-03-09 13:01:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 13:01:30] [INFO ] Invariant cache hit.
[2023-03-09 13:01:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-09 13:01:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:30] [INFO ] Invariant cache hit.
[2023-03-09 13:01:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-09 13:01:30] [INFO ] Invariant cache hit.
[2023-03-09 13:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 13:01:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:30] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:30] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10252 reset in 59 ms.
Product exploration explored 100000 steps with 10182 reset in 71 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:01:31] [INFO ] Invariant cache hit.
[2023-03-09 13:01:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 13:01:31] [INFO ] Invariant cache hit.
[2023-03-09 13:01:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-09 13:01:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:31] [INFO ] Invariant cache hit.
[2023-03-09 13:01:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-06 finished in 1619 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)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P2-LTLFireability-07
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 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 22 place count 12 transition count 8
Applied a total of 22 rules in 6 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 13:01:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 13:01:31] [INFO ] Implicit Places using invariants in 28 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 13:01:31] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 13:01:31] [INFO ] Implicit Places using invariants in 22 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 65 ms. Remains : 6/24 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10233 reset in 59 ms.
Product exploration explored 100000 steps with 10216 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 13:01:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 13:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:01:31] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 13:01:31] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:01:31] [INFO ] Invariant cache hit.
[2023-03-09 13:01:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 13:01:31] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-09 13:01:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 257 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=85 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 13:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-09 13:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 13:01:32] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:32] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10237 reset in 60 ms.
Product exploration explored 100000 steps with 10284 reset in 73 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-09 13:01:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-07 finished in 1540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((X(p2)||p1))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P2-LTLFireability-08
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 21 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 13
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 11 place count 18 transition count 13
Applied a total of 11 rules in 2 ms. Remains 18 /24 variables (removed 6) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-09 13:01:32] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 13:01:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 13:01:32] [INFO ] Invariant cache hit.
[2023-03-09 13:01:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-09 13:01:33] [INFO ] Invariant cache hit.
[2023-03-09 13:01:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/24 places, 13/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 91 ms. Remains : 18/24 places, 13/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s11 1)), p1:(OR (LT s6 1) (LT s16 1)), p2:(OR (LT s4 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13935 reset in 80 ms.
Product exploration explored 100000 steps with 13946 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 443 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1012 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=253 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-09 13:01:34] [INFO ] Invariant cache hit.
[2023-03-09 13:01:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:34] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 13:01:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:34] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-09 13:01:34] [INFO ] Computed and/alt/rep : 12/14/12 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:34] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-09 13:01:34] [INFO ] Invariant cache hit.
[2023-03-09 13:01:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 13:01:34] [INFO ] Invariant cache hit.
[2023-03-09 13:01:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 13:01:34] [INFO ] Invariant cache hit.
[2023-03-09 13:01:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 18/18 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 385 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1312 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=328 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 480 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-09 13:01:36] [INFO ] Invariant cache hit.
[2023-03-09 13:01:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:36] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-09 13:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 13:01:36] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 13:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-09 13:01:36] [INFO ] Computed and/alt/rep : 12/14/12 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:36] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13909 reset in 82 ms.
Product exploration explored 100000 steps with 14011 reset in 93 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-09 13:01:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 13:01:36] [INFO ] Invariant cache hit.
[2023-03-09 13:01:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 13/13 transitions.
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-09 13:01:36] [INFO ] Invariant cache hit.
[2023-03-09 13:01:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 13:01:36] [INFO ] Invariant cache hit.
[2023-03-09 13:01:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 13:01:36] [INFO ] Invariant cache hit.
[2023-03-09 13:01:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 18/18 places, 13/13 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-08 finished in 4231 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((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(!p2&&((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(p1)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P2-LTLFireability-09
Stuttering acceptance computed with spot in 164 ms :[p0, (AND p2 p0 (NOT p1)), p0, (AND p0 p2)]
Support contains 6 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 16
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 20 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 3 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-09 13:01:37] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:01:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 13:01:37] [INFO ] Invariant cache hit.
[2023-03-09 13:01:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 13:01:37] [INFO ] Invariant cache hit.
[2023-03-09 13:01:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/24 places, 11/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 90 ms. Remains : 15/24 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s13 1) (GEQ s3 1) (GEQ s10 1)), p0:(AND (GEQ s3 1) (GEQ s10 1)), p1:(AND (GEQ s5 1) (GEQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33540 reset in 155 ms.
Product exploration explored 100000 steps with 33367 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 19 factoid took 1249 ms. Reduced automaton from 4 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, (AND p0 p2 (NOT p1)), p0, (AND p0 p2)]
Incomplete random walk after 10007 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-09 13:01:39] [INFO ] Invariant cache hit.
[2023-03-09 13:01:39] [INFO ] After 17ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F p0), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 20 factoid took 1440 ms. Reduced automaton from 4 states, 20 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 166 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-09 13:01:40] [INFO ] Invariant cache hit.
[2023-03-09 13:01:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 13:01:40] [INFO ] Invariant cache hit.
[2023-03-09 13:01:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 13:01:40] [INFO ] Invariant cache hit.
[2023-03-09 13:01:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 15/15 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 839 ms. Reduced automaton from 4 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Finished random walk after 4918 steps, including 1 resets, run visited all 8 properties in 9 ms. (steps per millisecond=546 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 14 factoid took 1032 ms. Reduced automaton from 4 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 169 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Stuttering acceptance computed with spot in 169 ms :[(OR p0 p2), (AND (NOT p1) p2), (OR p0 p2), p2]
Product exploration explored 100000 steps with 33394 reset in 149 ms.
Product exploration explored 100000 steps with 33402 reset in 160 ms.
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-09 13:01:44] [INFO ] Invariant cache hit.
[2023-03-09 13:01:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 13:01:44] [INFO ] Invariant cache hit.
[2023-03-09 13:01:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-09 13:01:44] [INFO ] Invariant cache hit.
[2023-03-09 13:01:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 15/15 places, 11/11 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-09 finished in 7210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U !p1) U X((!p2||G(p3)||F(!p4)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((!p1&&F(p0))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P2-LTLFireability-11
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 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 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 4 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-09 13:01:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 13:01:44] [INFO ] Implicit Places using invariants in 30 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-09 13:01:44] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 13:01:44] [INFO ] Implicit Places using invariants in 26 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 66 ms. Remains : 11/24 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4493 reset in 86 ms.
Product exploration explored 100000 steps with 4504 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 377 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 247 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=247 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 9 rows 11 cols
[2023-03-09 13:01:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 13:01:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 13:01:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:46] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:46] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 13:01:46] [INFO ] Invariant cache hit.
[2023-03-09 13:01:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:46] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:46] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-09 13:01:46] [INFO ] Invariant cache hit.
[2023-03-09 13:01:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 13:01:46] [INFO ] Invariant cache hit.
[2023-03-09 13:01:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 13:01:46] [INFO ] Invariant cache hit.
[2023-03-09 13:01:46] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 11/11 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 247 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=247 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
[2023-03-09 13:01:46] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 13:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:47] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:47] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 13:01:47] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 13:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:01:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 13:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:01:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 13:01:47] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 13:01:47] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 4505 reset in 84 ms.
Product exploration explored 100000 steps with 4505 reset in 100 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-09 13:01:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 13:01:47] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32 ms. Remains : 11/11 places, 9/9 transitions.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-09 13:01:47] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 13:01:47] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-09 13:01:47] [INFO ] Invariant cache hit.
[2023-03-09 13:01:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 11/11 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-11 finished in 3462 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)))'
[2023-03-09 13:01:47] [INFO ] Flatten gal took : 5 ms
[2023-03-09 13:01:47] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 13:01:47] [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 55882 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4307/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-06
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-07
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-08
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-09
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-10
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-11
Could not compute solution for formula : ClientsAndServers-PT-N0020P2-LTLFireability-13

BK_STOP 1678366909667

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b0d1bfe3f4]
1: pnml2lts-mc(+0xa2496) [0x55b0d1bfe496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f63a8048140]
3: pnml2lts-mc(+0x405be5) [0x55b0d1f61be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b0d1cc73f9]
5: pnml2lts-mc(+0x164ac4) [0x55b0d1cc0ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b0d1dcee0a]
7: pnml2lts-mc(+0xb61f0) [0x55b0d1c121f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f63a7e9b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f63a7e9b67a]
10: pnml2lts-mc(+0xa1581) [0x55b0d1bfd581]
11: pnml2lts-mc(+0xa1910) [0x55b0d1bfd910]
12: pnml2lts-mc(+0xa32a2) [0x55b0d1bff2a2]
13: pnml2lts-mc(+0xa50f4) [0x55b0d1c010f4]
14: pnml2lts-mc(+0xa516b) [0x55b0d1c0116b]
15: pnml2lts-mc(+0x3f34b3) [0x55b0d1f4f4b3]
16: pnml2lts-mc(+0x7c63d) [0x55b0d1bd863d]
17: pnml2lts-mc(+0x67d86) [0x55b0d1bc3d86]
18: pnml2lts-mc(+0x60a8a) [0x55b0d1bbca8a]
19: pnml2lts-mc(+0x5eb15) [0x55b0d1bbab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f63a7e83d0a]
21: pnml2lts-mc(+0x6075e) [0x55b0d1bbc75e]
ltl formula name ClientsAndServers-PT-N0020P2-LTLFireability-09
ltl formula formula --ltl=/tmp/4307/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4307/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4307/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4307/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4307/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55ec5a3b73f4]
1: pnml2lts-mc(+0xa2496) [0x55ec5a3b7496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f532e0d4140]
3: pnml2lts-mc(+0x405be5) [0x55ec5a71abe5]
4: pnml2lts-mc(+0x16b3f9) [0x55ec5a4803f9]
5: pnml2lts-mc(+0x164ac4) [0x55ec5a479ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ec5a587e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ec5a3cb1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f532df274d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f532df2767a]
10: pnml2lts-mc(+0xa1581) [0x55ec5a3b6581]
11: pnml2lts-mc(+0xa1910) [0x55ec5a3b6910]
12: pnml2lts-mc(+0xa32a2) [0x55ec5a3b82a2]
13: pnml2lts-mc(+0xa50f4) [0x55ec5a3ba0f4]
14: pnml2lts-mc(+0xa516b) [0x55ec5a3ba16b]
15: pnml2lts-mc(+0x3f34b3) [0x55ec5a7084b3]
16: pnml2lts-mc(+0x7c63d) [0x55ec5a39163d]
17: pnml2lts-mc(+0x67d86) [0x55ec5a37cd86]
18: pnml2lts-mc(+0x60a8a) [0x55ec5a375a8a]
19: pnml2lts-mc(+0x5eb15) [0x55ec5a373b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f532df0fd0a]
21: pnml2lts-mc(+0x6075e) [0x55ec5a37575e]
ltl formula name ClientsAndServers-PT-N0020P2-LTLFireability-10
ltl formula formula --ltl=/tmp/4307/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4307/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4307/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4307/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4307/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ClientsAndServers-PT-N0020P2-LTLFireability-11
ltl formula formula --ltl=/tmp/4307/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4307/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4307/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4307/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4307/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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