Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102300408.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ServersAndClients-PT-200040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102300408
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.1M May 18 16:43 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 ServersAndClients-PT-200040-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716894869926

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 11:14:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 11:14:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:14:32] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2024-05-28 11:14:32] [INFO ] Transformed 8841 places.
[2024-05-28 11:14:32] [INFO ] Transformed 16400 transitions.
[2024-05-28 11:14:32] [INFO ] Found NUPN structural information;
[2024-05-28 11:14:32] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-200040-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2317 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 11:14:35] [INFO ] Computed 441 invariants in 300 ms
[2024-05-28 11:14:36] [INFO ] Implicit Places using invariants in 1739 ms returned []
Implicit Place search using SMT only with invariants took 1768 ms to find 0 implicit places.
[2024-05-28 11:14:36] [INFO ] Invariant cache hit.
[2024-05-28 11:14:37] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5281 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Support contains 52 out of 8841 places after structural reductions.
[2024-05-28 11:14:38] [INFO ] Flatten gal took : 818 ms
[2024-05-28 11:14:39] [INFO ] Flatten gal took : 488 ms
[2024-05-28 11:14:40] [INFO ] Input system was already deterministic with 16400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 40) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-28 11:14:42] [INFO ] Invariant cache hit.
[2024-05-28 11:14:45] [INFO ] [Real]Absence check using 241 positive place invariants in 473 ms returned sat
[2024-05-28 11:14:45] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 170 ms returned sat
[2024-05-28 11:15:06] [INFO ] After 19271ms SMT Verify possible using state equation in real domain returned unsat :2 sat :10
[2024-05-28 11:15:07] [INFO ] After 20092ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-28 11:15:07] [INFO ] After 25061ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 9 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 8 properties in 55 ms.
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7998 transitions
Trivial Post-agglo rules discarded 7998 transitions
Performed 7998 trivial Post agglomeration. Transition count delta: 7998
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8841 transition count 8402
Reduce places removed 8036 places and 0 transitions.
Ensure Unique test removed 7400 transitions
Reduce isomorphic transitions removed 7400 transitions.
Iterating post reduction 1 with 15436 rules applied. Total rules applied 23434 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 23832 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 24426 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Drop transitions removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 792 rules applied. Total rules applied 25218 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 25220 place count 13 transition count 10
Applied a total of 25220 rules in 230 ms. Remains 13 /8841 variables (removed 8828) and now considering 10/16400 (removed 16390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 13/8841 places, 10/16400 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2175 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:10] [INFO ] Invariant cache hit.
[2024-05-28 11:15:11] [INFO ] Implicit Places using invariants in 1163 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2024-05-28 11:15:11] [INFO ] Invariant cache hit.
[2024-05-28 11:15:12] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4484 ms. Remains : 8841/8841 places, 16400/16400 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 284 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s2977 1), p0:(EQ s5823 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 1 steps with 0 reset in 4 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-00 finished in 4866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||(p1&&G(p2)))))))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1689 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:14] [INFO ] Invariant cache hit.
[2024-05-28 11:15:15] [INFO ] Implicit Places using invariants in 1203 ms returned []
Implicit Place search using SMT only with invariants took 1206 ms to find 0 implicit places.
[2024-05-28 11:15:15] [INFO ] Invariant cache hit.
[2024-05-28 11:15:17] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4003 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s2696 1), p1:(EQ s2696 0), p2:(OR (EQ s341 0) (EQ s742 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 463 steps with 0 reset in 40 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-01 finished in 4371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1 U p2)))))'
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2280 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:19] [INFO ] Invariant cache hit.
[2024-05-28 11:15:20] [INFO ] Implicit Places using invariants in 1094 ms returned []
Implicit Place search using SMT only with invariants took 1096 ms to find 0 implicit places.
[2024-05-28 11:15:20] [INFO ] Invariant cache hit.
[2024-05-28 11:15:21] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4409 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (EQ s553 1) (EQ s8640 1)) (AND (EQ s687 1) (EQ s3615 1))), p1:(AND (EQ s687 1) (EQ s3615 1)), p0:(OR (NOT (AND (EQ s553 1) (EQ s8640 1))) (EQ ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 254 reset in 4005 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-03 finished in 8634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U (G(!p2) U X(p3)))))'
Support contains 7 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1960 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:28] [INFO ] Invariant cache hit.
[2024-05-28 11:15:29] [INFO ] Implicit Places using invariants in 1117 ms returned []
Implicit Place search using SMT only with invariants took 1121 ms to find 0 implicit places.
[2024-05-28 11:15:29] [INFO ] Invariant cache hit.
[2024-05-28 11:15:30] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4179 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), true, p2, (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(AND p2 p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND p2 p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s517 0) (EQ s4218 0)), p2:(AND (EQ s715 1) (EQ s3213 1)), p1:(AND (EQ s176 1) (EQ s400 1)), p3:(EQ s6717 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1209 steps with 0 reset in 47 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-04 finished in 4690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1979 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:32] [INFO ] Invariant cache hit.
[2024-05-28 11:15:33] [INFO ] Implicit Places using invariants in 1114 ms returned []
Implicit Place search using SMT only with invariants took 1116 ms to find 0 implicit places.
[2024-05-28 11:15:33] [INFO ] Invariant cache hit.
[2024-05-28 11:15:35] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4252 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2855 0), p1:(OR (EQ s749 0) (EQ s3615 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 98740 steps with 49370 reset in 10001 ms.
Product exploration timeout after 97320 steps with 48660 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLFireability-05 finished in 24546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&F(G(p2))))||p0))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1964 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:15:57] [INFO ] Invariant cache hit.
[2024-05-28 11:15:58] [INFO ] Implicit Places using invariants in 1114 ms returned []
Implicit Place search using SMT only with invariants took 1118 ms to find 0 implicit places.
[2024-05-28 11:15:58] [INFO ] Invariant cache hit.
[2024-05-28 11:15:59] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4209 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s731 0) (EQ s1806 0)), p1:(EQ s2348 1), p2:(AND (EQ s731 1) (EQ s1806 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 timeout after 98130 steps with 48945 reset in 10078 ms.
Product exploration timeout after 97990 steps with 48872 reset in 10057 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200040-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLFireability-06 finished in 24641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U G(X(p1))) U p2))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1992 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:16:21] [INFO ] Invariant cache hit.
[2024-05-28 11:16:23] [INFO ] Implicit Places using invariants in 1134 ms returned []
Implicit Place search using SMT only with invariants took 1139 ms to find 0 implicit places.
[2024-05-28 11:16:23] [INFO ] Invariant cache hit.
[2024-05-28 11:16:24] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s8091 1) (EQ s5851 1)), p1:(EQ s5851 1), p0:(EQ s4610 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-07 finished in 4534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p1))&&p0))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1959 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:16:26] [INFO ] Invariant cache hit.
[2024-05-28 11:16:27] [INFO ] Implicit Places using invariants in 1114 ms returned []
Implicit Place search using SMT only with invariants took 1119 ms to find 0 implicit places.
[2024-05-28 11:16:27] [INFO ] Invariant cache hit.
[2024-05-28 11:16:28] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4210 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (EQ s743 0) (EQ s8238 0)), p0:(AND (EQ s4014 1) (EQ s743 1) (EQ s8238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-08 finished in 4406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p1||F(p2))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7759 transitions
Trivial Post-agglo rules discarded 7759 transitions
Performed 7759 trivial Post agglomeration. Transition count delta: 7759
Iterating post reduction 0 with 7759 rules applied. Total rules applied 7759 place count 8841 transition count 8641
Reduce places removed 7759 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 7798 rules applied. Total rules applied 15557 place count 1082 transition count 8602
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 2 with 7276 rules applied. Total rules applied 22833 place count 1006 transition count 1402
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 23231 place count 1006 transition count 1004
Applied a total of 23231 rules in 254 ms. Remains 1006 /8841 variables (removed 7835) and now considering 1004/16400 (removed 15396) transitions.
// Phase 1: matrix 1004 rows 1006 cols
[2024-05-28 11:16:29] [INFO ] Computed 404 invariants in 8 ms
[2024-05-28 11:16:29] [INFO ] Implicit Places using invariants in 758 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 801, 803]
Discarding 402 places :
Implicit Place search using SMT only with invariants took 769 ms to find 402 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 604/8841 places, 1004/16400 transitions.
Graph (trivial) has 598 edges and 604 vertex of which 399 / 604 are part of one of the 1 SCC in 3 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 8 transition count 210
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 8 transition count 210
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 8 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 1 with 2 rules applied. Total rules applied 597 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 6 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 6 transition count 10
Applied a total of 599 rules in 15 ms. Remains 6 /604 variables (removed 598) and now considering 10/1004 (removed 994) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-05-28 11:16:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:16:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 11:16:29] [INFO ] Invariant cache hit.
[2024-05-28 11:16:30] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/8841 places, 10/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1106 ms. Remains : 6/8841 places, 10/16400 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p2:(EQ s3 1), p0:(AND (EQ s0 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-09 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U (p1 U (p2||G(p1)))))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1637 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 11:16:31] [INFO ] Computed 441 invariants in 142 ms
[2024-05-28 11:16:33] [INFO ] Implicit Places using invariants in 1266 ms returned []
Implicit Place search using SMT only with invariants took 1268 ms to find 0 implicit places.
[2024-05-28 11:16:33] [INFO ] Invariant cache hit.
[2024-05-28 11:16:34] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4044 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s6907 1) (EQ s673 1) (EQ s6429 1)), p1:(AND (EQ s673 1) (EQ s6429 1)), p0:(NEQ s7480 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 125 reset in 3769 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-10 finished in 8030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(F((G(F(!p1))||(p2&&F(!p1))))))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1639 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2024-05-28 11:16:39] [INFO ] Invariant cache hit.
[2024-05-28 11:16:40] [INFO ] Implicit Places using invariants in 1107 ms returned []
Implicit Place search using SMT only with invariants took 1109 ms to find 0 implicit places.
[2024-05-28 11:16:40] [INFO ] Invariant cache hit.
[2024-05-28 11:16:41] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3846 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p1 p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s7253 1), p1:(AND (EQ s781 1) (EQ s4419 1) (EQ s7253 1)), p0:(OR (NEQ s781 1) (NEQ s4419 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 3714 ms.
Product exploration explored 100000 steps with 5 reset in 3875 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 20874 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{3=1, 5=1}
Probabilistic random walk after 20874 steps, saw 7130 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :2
Running SMT prover for 6 properties.
[2024-05-28 11:16:54] [INFO ] Invariant cache hit.
[2024-05-28 11:16:56] [INFO ] [Real]Absence check using 241 positive place invariants in 523 ms returned sat
[2024-05-28 11:16:56] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 209 ms returned sat
[2024-05-28 11:16:56] [INFO ] After 2365ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 p2))))), (G (NOT (AND p0 p2 p1))), (G (NOT (OR (AND (NOT p0) p1) (AND p2 p1)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND p0 p2 (NOT p1))), (F p2)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 25 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-200040-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLFireability-11 finished in 18869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(p1)||G(!p0)))))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7524 transitions
Trivial Post-agglo rules discarded 7524 transitions
Performed 7524 trivial Post agglomeration. Transition count delta: 7524
Iterating post reduction 0 with 7524 rules applied. Total rules applied 7524 place count 8841 transition count 8876
Reduce places removed 7524 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 1 with 7600 rules applied. Total rules applied 15124 place count 1317 transition count 8800
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 7400 transitions
Reduce isomorphic transitions removed 7400 transitions.
Iterating post reduction 2 with 7514 rules applied. Total rules applied 22638 place count 1203 transition count 1400
Applied a total of 22638 rules in 174 ms. Remains 1203 /8841 variables (removed 7638) and now considering 1400/16400 (removed 15000) transitions.
// Phase 1: matrix 1400 rows 1203 cols
[2024-05-28 11:16:57] [INFO ] Computed 403 invariants in 17 ms
[2024-05-28 11:16:57] [INFO ] Implicit Places using invariants in 774 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 778 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/8841 places, 1400/16400 transitions.
Graph (trivial) has 596 edges and 803 vertex of which 397 / 803 are part of one of the 1 SCC in 0 ms
Free SCC test removed 396 places
Ensure Unique test removed 593 transitions
Reduce isomorphic transitions removed 593 transitions.
Discarding 395 places :
Symmetric choice reduction at 0 with 395 rule applications. Total rules 396 place count 12 transition count 412
Iterating global reduction 0 with 395 rules applied. Total rules applied 791 place count 12 transition count 412
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 0 with 394 rules applied. Total rules applied 1185 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1187 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 1189 place count 10 transition count 16
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 1 with 2 rules applied. Total rules applied 1191 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1193 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 1195 place count 7 transition count 13
Applied a total of 1195 rules in 12 ms. Remains 7 /803 variables (removed 796) and now considering 13/1400 (removed 1387) transitions.
// Phase 1: matrix 13 rows 7 cols
[2024-05-28 11:16:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:16:57] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-28 11:16:57] [INFO ] Invariant cache hit.
[2024-05-28 11:16:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/8841 places, 13/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1000 ms. Remains : 7/8841 places, 13/16400 transitions.
Stuttering acceptance computed with spot in 153 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s3 1)), p1:(AND (EQ s0 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9163 reset in 137 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-12 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||G(p1))&&(F(p3)||p2))))'
Support contains 6 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7289 transitions
Trivial Post-agglo rules discarded 7289 transitions
Performed 7289 trivial Post agglomeration. Transition count delta: 7289
Iterating post reduction 0 with 7289 rules applied. Total rules applied 7289 place count 8841 transition count 9111
Reduce places removed 7289 places and 0 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 1 with 7400 rules applied. Total rules applied 14689 place count 1552 transition count 9000
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 2 with 7348 rules applied. Total rules applied 22037 place count 1404 transition count 1800
Applied a total of 22037 rules in 194 ms. Remains 1404 /8841 variables (removed 7437) and now considering 1800/16400 (removed 14600) transitions.
// Phase 1: matrix 1800 rows 1404 cols
[2024-05-28 11:16:58] [INFO ] Computed 404 invariants in 17 ms
[2024-05-28 11:16:59] [INFO ] Implicit Places using invariants in 847 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 851 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/8841 places, 1800/16400 transitions.
Graph (trivial) has 594 edges and 1004 vertex of which 395 / 1004 are part of one of the 1 SCC in 0 ms
Free SCC test removed 394 places
Ensure Unique test removed 590 transitions
Reduce isomorphic transitions removed 590 transitions.
Discarding 590 places :
Symmetric choice reduction at 0 with 590 rule applications. Total rules 591 place count 20 transition count 620
Iterating global reduction 0 with 590 rules applied. Total rules applied 1181 place count 20 transition count 620
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Iterating post reduction 0 with 588 rules applied. Total rules applied 1769 place count 20 transition count 32
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1775 place count 14 transition count 26
Iterating global reduction 1 with 6 rules applied. Total rules applied 1781 place count 14 transition count 26
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 1 with 2 rules applied. Total rules applied 1783 place count 13 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1786 place count 10 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 1789 place count 10 transition count 22
Applied a total of 1789 rules in 13 ms. Remains 10 /1004 variables (removed 994) and now considering 22/1800 (removed 1778) transitions.
// Phase 1: matrix 22 rows 10 cols
[2024-05-28 11:16:59] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 11:16:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 11:16:59] [INFO ] Invariant cache hit.
[2024-05-28 11:16:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/8841 places, 22/16400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1099 ms. Remains : 10/8841 places, 22/16400 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1)), p1:(AND (EQ s2 1) (EQ s4 1)), p2:(OR (AND (EQ s1 1) (EQ s8 1)) (AND (EQ s0 1) (EQ s6 1))), p3:(AND (EQ s0 1) (EQ s6 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 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-13 finished in 1376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(F(p1))))||G(p0))))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1646 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 11:17:01] [INFO ] Computed 441 invariants in 138 ms
[2024-05-28 11:17:02] [INFO ] Implicit Places using invariants in 1278 ms returned []
Implicit Place search using SMT only with invariants took 1280 ms to find 0 implicit places.
[2024-05-28 11:17:02] [INFO ] Invariant cache hit.
[2024-05-28 11:17:03] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4063 ms. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s5667 1), p1:(EQ s5910 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 3668 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-14 finished in 7988 ms.
All properties solved by simple procedures.
Total runtime 156132 ms.

BK_STOP 1716895028746

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ServersAndClients-PT-200040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ServersAndClients-PT-200040, 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 r351-tall-171679102300408"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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