fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r359-smll-167891809000460
Last Updated
May 14, 2023

About the Execution of LoLa+red for ServersAndClients-PT-100020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
835.632 49436.00 73740.00 593.90 FFTFFFTFFFFFFFFT normal

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.r359-smll-167891809000460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ServersAndClients-PT-100020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809000460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 11K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 03:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 03:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 03:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.1M Mar 5 18:23 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-100020-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679117758893

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 05:36:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 05:36:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:36:03] [INFO ] Load time of PNML (sax parser for PT used): 589 ms
[2023-03-18 05:36:03] [INFO ] Transformed 2421 places.
[2023-03-18 05:36:03] [INFO ] Transformed 4200 transitions.
[2023-03-18 05:36:03] [INFO ] Found NUPN structural information;
[2023-03-18 05:36:03] [INFO ] Parsed PT model containing 2421 places and 4200 transitions and 12800 arcs in 808 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ServersAndClients-PT-100020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 558 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2023-03-18 05:36:04] [INFO ] Computed 221 place invariants in 139 ms
[2023-03-18 05:36:06] [INFO ] Implicit Places using invariants in 2065 ms returned []
[2023-03-18 05:36:06] [INFO ] Invariant cache hit.
[2023-03-18 05:36:07] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
[2023-03-18 05:36:07] [INFO ] Invariant cache hit.
[2023-03-18 05:36:08] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4813 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Support contains 27 out of 2421 places after structural reductions.
[2023-03-18 05:36:09] [INFO ] Flatten gal took : 588 ms
[2023-03-18 05:36:09] [INFO ] Flatten gal took : 228 ms
[2023-03-18 05:36:10] [INFO ] Input system was already deterministic with 4200 transitions.
Finished random walk after 9345 steps, including 2 resets, run visited all 20 properties in 776 ms. (steps per millisecond=12 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2421 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 5916 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 6213 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 6608 place count 7 transition count 6
Applied a total of 6608 rules in 94 ms. Remains 7 /2421 variables (removed 2414) and now considering 6/4200 (removed 4194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 05:36:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 05:36:11] [INFO ] Implicit Places using invariants in 52 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2421 places, 6/4200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 5 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 05:36:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 05:36:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 05:36:11] [INFO ] Invariant cache hit.
[2023-03-18 05:36:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2421 places, 3/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 2/2421 places, 3/4200 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 440 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 2 in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-00 finished in 998 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(F(p0))&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 5 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 332 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2023-03-18 05:36:12] [INFO ] Computed 221 place invariants in 85 ms
[2023-03-18 05:36:14] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2023-03-18 05:36:14] [INFO ] Invariant cache hit.
[2023-03-18 05:36:14] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2023-03-18 05:36:14] [INFO ] Invariant cache hit.
[2023-03-18 05:36:19] [INFO ] Dead Transitions using invariants and state equation in 4273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6925 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) p1), (NOT p0), (NOT p0), p1, p1]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1516 1), p2:(AND (EQ s361 1) (EQ s1916 1)), p1:(AND (EQ s41 1) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 1918 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-100020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-01 finished in 9137 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(p1)&&p0)) U (X(p3)&&p2)))'
Support contains 5 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 290 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
[2023-03-18 05:36:21] [INFO ] Invariant cache hit.
[2023-03-18 05:36:22] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-18 05:36:22] [INFO ] Invariant cache hit.
[2023-03-18 05:36:24] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2023-03-18 05:36:24] [INFO ] Invariant cache hit.
[2023-03-18 05:36:25] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3771 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s337 1) (EQ s502 1)), p0:(AND (EQ s337 1) (EQ s502 1)), p1:(AND (EQ s315 1) (EQ s1714 1)), p3:(NEQ s1249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-03 finished in 4106 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)||X(X(X(X(F(p1)))))))'
Support contains 3 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 281 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
[2023-03-18 05:36:25] [INFO ] Invariant cache hit.
[2023-03-18 05:36:27] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2023-03-18 05:36:27] [INFO ] Invariant cache hit.
[2023-03-18 05:36:28] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
[2023-03-18 05:36:28] [INFO ] Invariant cache hit.
[2023-03-18 05:36:29] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3715 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s547 1), p1:(AND (EQ s377 1) (EQ s1714 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 285 reset in 2194 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-100020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-05 finished in 6204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(!p0))))'
Support contains 2 out of 2421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2421 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 540 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 502 transition count 500
Applied a total of 5619 rules in 91 ms. Remains 502 /2421 variables (removed 1919) and now considering 500/4200 (removed 3700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-18 05:36:31] [INFO ] Computed 202 place invariants in 4 ms
[2023-03-18 05:36:32] [INFO ] Implicit Places using invariants in 723 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]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 727 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/2421 places, 500/4200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 12 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-18 05:36:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 05:36:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 05:36:32] [INFO ] Invariant cache hit.
[2023-03-18 05:36:32] [INFO ] Implicit Places using invariants and state equation in 20 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 : 4/2421 places, 6/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 872 ms. Remains : 4/2421 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), p0]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-08 finished in 996 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(p1))&&p0)))'
Support contains 3 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 200 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2023-03-18 05:36:32] [INFO ] Computed 221 place invariants in 29 ms
[2023-03-18 05:36:33] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-18 05:36:33] [INFO ] Invariant cache hit.
[2023-03-18 05:36:34] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2023-03-18 05:36:34] [INFO ] Invariant cache hit.
[2023-03-18 05:36:35] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2328 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s347 1) (EQ s805 1)), p1:(EQ s2178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-09 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2421 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 540 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 502 transition count 500
Applied a total of 5619 rules in 64 ms. Remains 502 /2421 variables (removed 1919) and now considering 500/4200 (removed 3700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-18 05:36:35] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-18 05:36:36] [INFO ] Implicit Places using invariants in 755 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]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 759 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/2421 places, 500/4200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 2 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 13 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-18 05:36:36] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 05:36:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 05:36:36] [INFO ] Invariant cache hit.
[2023-03-18 05:36:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2421 places, 6/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 887 ms. Remains : 4/2421 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-10 finished in 959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((p1 U p2))))))'
Support contains 5 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 189 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2023-03-18 05:36:36] [INFO ] Computed 221 place invariants in 37 ms
[2023-03-18 05:36:37] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2023-03-18 05:36:37] [INFO ] Invariant cache hit.
[2023-03-18 05:36:39] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2023-03-18 05:36:39] [INFO ] Invariant cache hit.
[2023-03-18 05:36:43] [INFO ] Dead Transitions using invariants and state equation in 4637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7679 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s399 1) (EQ s2219 1)), p2:(AND (EQ s273 1) (EQ s1714 1)), p1:(EQ s1171 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 0 reset in 1960 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-100020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-11 finished in 9875 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((((p1&&F(!p1)) U (!p1 U G(p1)))||p0)))'
Support contains 3 out of 2421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2421 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 541 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 5615 place count 504 transition count 502
Applied a total of 5615 rules in 88 ms. Remains 504 /2421 variables (removed 1917) and now considering 502/4200 (removed 3698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2023-03-18 05:36:46] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-18 05:36:46] [INFO ] Implicit Places using invariants in 711 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, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 715 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/2421 places, 502/4200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 1 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
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 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 10 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-18 05:36:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 05:36:46] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 05:36:46] [INFO ] Invariant cache hit.
[2023-03-18 05:36:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/2421 places, 8/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 863 ms. Remains : 5/2421 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s4 1), p0:(OR (EQ s0 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-12 finished in 1113 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))'
Support contains 1 out of 2421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2421 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 5916 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 6213 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 6608 place count 7 transition count 6
Applied a total of 6608 rules in 72 ms. Remains 7 /2421 variables (removed 2414) and now considering 6/4200 (removed 4194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 05:36:47] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 05:36:47] [INFO ] Implicit Places using invariants in 35 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2421 places, 6/4200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 05:36:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 05:36:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 05:36:47] [INFO ] Invariant cache hit.
[2023-03-18 05:36:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2421 places, 3/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 2/2421 places, 3/4200 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-14 finished in 240 ms.
All properties solved by simple procedures.
Total runtime 44885 ms.
ITS solved all properties within timeout

BK_STOP 1679117808329

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ServersAndClients-PT-100020, 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 r359-smll-167891809000460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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