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-171679102300418.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-200160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102300418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 16:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:51 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 20M 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-200160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716896071890

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-200160
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 11:34:33] [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:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:34:34] [INFO ] Load time of PNML (sax parser for PT used): 984 ms
[2024-05-28 11:34:34] [INFO ] Transformed 32961 places.
[2024-05-28 11:34:34] [INFO ] Transformed 64400 transitions.
[2024-05-28 11:34:34] [INFO ] Found NUPN structural information;
[2024-05-28 11:34:34] [INFO ] Parsed PT model containing 32961 places and 64400 transitions and 193600 arcs in 1242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ServersAndClients-PT-200160-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 568 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2024-05-28 11:34:36] [INFO ] Computed 561 invariants in 1048 ms
[2024-05-28 11:34:40] [INFO ] Implicit Places using invariants in 5283 ms returned []
Implicit Place search using SMT only with invariants took 5308 ms to find 0 implicit places.
[2024-05-28 11:34:40] [INFO ] Invariant cache hit.
[2024-05-28 11:34:45] [INFO ] Dead Transitions using invariants and state equation in 4333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10227 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Support contains 46 out of 32961 places after structural reductions.
[2024-05-28 11:34:47] [INFO ] Flatten gal took : 2050 ms
[2024-05-28 11:34:49] [INFO ] Flatten gal took : 1628 ms
[2024-05-28 11:34:52] [INFO ] Input system was already deterministic with 64400 transitions.
Support contains 44 out of 32961 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1215 ms. (steps per millisecond=8 ) properties (out of 32) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-28 11:34:55] [INFO ] Invariant cache hit.
[2024-05-28 11:35:08] [INFO ] [Real]Absence check using 361 positive place invariants in 1450 ms returned sat
[2024-05-28 11:35:09] [INFO ] [Real]Absence check using 361 positive and 200 generalized place invariants in 1026 ms returned sat
[2024-05-28 11:35:20] [INFO ] After 6534ms SMT Verify possible using state equation in real domain returned unsat :1 sat :7
[2024-05-28 11:35:20] [INFO ] After 6605ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 11:35:20] [INFO ] After 25123ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :7
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 32961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31992 transitions
Trivial Post-agglo rules discarded 31992 transitions
Performed 31992 trivial Post agglomeration. Transition count delta: 31992
Iterating post reduction 0 with 31992 rules applied. Total rules applied 31992 place count 32961 transition count 32408
Reduce places removed 32144 places and 0 transitions.
Ensure Unique test removed 30200 transitions
Reduce isomorphic transitions removed 30200 transitions.
Iterating post reduction 1 with 62344 rules applied. Total rules applied 94336 place count 817 transition count 2208
Drop transitions removed 1592 transitions
Redundant transition composition rules discarded 1592 transitions
Iterating global reduction 2 with 1592 rules applied. Total rules applied 95928 place count 817 transition count 616
Discarding 192 places :
Implicit places reduction removed 192 places
Drop transitions removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 2 with 576 rules applied. Total rules applied 96504 place count 625 transition count 232
Reduce places removed 576 places and 0 transitions.
Drop transitions removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 3 with 768 rules applied. Total rules applied 97272 place count 49 transition count 40
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 97280 place count 49 transition count 40
Applied a total of 97280 rules in 1014 ms. Remains 49 /32961 variables (removed 32912) and now considering 40/64400 (removed 64360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1014 ms. Remains : 49/32961 places, 40/64400 transitions.
Finished random walk after 88 steps, including 0 resets, run visited all 8 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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(F(p0)))'
Support contains 1 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 545 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:35:22] [INFO ] Invariant cache hit.
[2024-05-28 11:35:26] [INFO ] Implicit Places using invariants in 4212 ms returned []
Implicit Place search using SMT only with invariants took 4216 ms to find 0 implicit places.
[2024-05-28 11:35:26] [INFO ] Invariant cache hit.
[2024-05-28 11:35:30] [INFO ] Dead Transitions using invariants and state equation in 3851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8617 ms. Remains : 32961/32961 places, 64400/64400 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 206 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2678 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 9137 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 6 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-00 finished in 18150 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&&X(X(F(p1))))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 253 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:35:40] [INFO ] Invariant cache hit.
[2024-05-28 11:35:44] [INFO ] Implicit Places using invariants in 3800 ms returned []
Implicit Place search using SMT only with invariants took 3803 ms to find 0 implicit places.
[2024-05-28 11:35:44] [INFO ] Invariant cache hit.
[2024-05-28 11:35:48] [INFO ] Dead Transitions using invariants and state equation in 4036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8100 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s30089 1) (EQ s25458 1)), p0:(EQ s30089 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 9131 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 7 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-01 finished in 17509 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((p0&&G(F(p1)))))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 411 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:35:57] [INFO ] Invariant cache hit.
[2024-05-28 11:36:02] [INFO ] Implicit Places using invariants in 4288 ms returned []
Implicit Place search using SMT only with invariants took 4289 ms to find 0 implicit places.
[2024-05-28 11:36:02] [INFO ] Invariant cache hit.
[2024-05-28 11:36:06] [INFO ] Dead Transitions using invariants and state equation in 4201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8910 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s32825 0), p1:(EQ s23748 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 8699 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 6 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-02 finished in 17978 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&&(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31284 transitions
Trivial Post-agglo rules discarded 31284 transitions
Performed 31284 trivial Post agglomeration. Transition count delta: 31284
Iterating post reduction 0 with 31284 rules applied. Total rules applied 31284 place count 32961 transition count 33116
Reduce places removed 31284 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 31600 rules applied. Total rules applied 62884 place count 1677 transition count 32800
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 2 with 31874 rules applied. Total rules applied 94758 place count 1203 transition count 1400
Applied a total of 94758 rules in 1203 ms. Remains 1203 /32961 variables (removed 31758) and now considering 1400/64400 (removed 63000) transitions.
// Phase 1: matrix 1400 rows 1203 cols
[2024-05-28 11:36:16] [INFO ] Computed 403 invariants in 16 ms
[2024-05-28 11:36:17] [INFO ] Implicit Places using invariants in 793 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 797 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/32961 places, 1400/64400 transitions.
Graph (trivial) has 596 edges and 803 vertex of which 397 / 803 are part of one of the 1 SCC in 3 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 27 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:36:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:36:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 11:36:17] [INFO ] Invariant cache hit.
[2024-05-28 11:36:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32961 places, 13/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2077 ms. Remains : 7/32961 places, 13/64400 transitions.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s3 0)), p1:(AND (EQ s1 1) (EQ s5 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 162 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 3 in 1 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-03 finished in 2325 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((F(p1)||p0))))'
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32961 transition count 32401
Reduce places removed 32158 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63758 rules applied. Total rules applied 95757 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 95956 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Iterating post reduction 2 with 398 rules applied. Total rules applied 96354 place count 604 transition count 403
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 3 with 199 rules applied. Total rules applied 96553 place count 405 transition count 403
Applied a total of 96553 rules in 659 ms. Remains 405 /32961 variables (removed 32556) and now considering 403/64400 (removed 63997) transitions.
// Phase 1: matrix 403 rows 405 cols
[2024-05-28 11:36:18] [INFO ] Computed 203 invariants in 4 ms
[2024-05-28 11:36:18] [INFO ] Implicit Places using invariants in 235 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, 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, 403]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 238 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/32961 places, 403/64400 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 6 transition count 205
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 6 transition count 205
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 593 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 594 place count 6 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 595 place count 6 transition count 7
Applied a total of 595 rules in 6 ms. Remains 6 /204 variables (removed 198) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-28 11:36:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:36:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 11:36:18] [INFO ] Invariant cache hit.
[2024-05-28 11:36:18] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32961 places, 7/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 940 ms. Remains : 6/32961 places, 7/64400 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s1 0)), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10264 reset in 71 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-04 finished in 1135 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((X(G(p0))&&F(p1))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31284 transitions
Trivial Post-agglo rules discarded 31284 transitions
Performed 31284 trivial Post agglomeration. Transition count delta: 31284
Iterating post reduction 0 with 31284 rules applied. Total rules applied 31284 place count 32961 transition count 33116
Reduce places removed 31284 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 31600 rules applied. Total rules applied 62884 place count 1677 transition count 32800
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 2 with 31874 rules applied. Total rules applied 94758 place count 1203 transition count 1400
Applied a total of 94758 rules in 811 ms. Remains 1203 /32961 variables (removed 31758) and now considering 1400/64400 (removed 63000) transitions.
// Phase 1: matrix 1400 rows 1203 cols
[2024-05-28 11:36:19] [INFO ] Computed 403 invariants in 15 ms
[2024-05-28 11:36:20] [INFO ] Implicit Places using invariants in 833 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 839 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/32961 places, 1400/64400 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 10 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:36:20] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 11:36:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 11:36:20] [INFO ] Invariant cache hit.
[2024-05-28 11:36:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32961 places, 13/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1708 ms. Remains : 7/32961 places, 13/64400 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s3 1)), p0:(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][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-05 finished in 1871 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((G(p0)||(p1&&X(p1))))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 344 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2024-05-28 11:36:21] [INFO ] Computed 561 invariants in 700 ms
[2024-05-28 11:36:25] [INFO ] Implicit Places using invariants in 4416 ms returned []
Implicit Place search using SMT only with invariants took 4417 ms to find 0 implicit places.
[2024-05-28 11:36:25] [INFO ] Invariant cache hit.
[2024-05-28 11:36:29] [INFO ] Dead Transitions using invariants and state equation in 3815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8581 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(AND (EQ s465 1) (EQ s23514 1)), p1:(OR (EQ s465 0) (EQ s23514 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 56650 steps with 18862 reset in 10001 ms.
Product exploration timeout after 54880 steps with 18340 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=10 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 11:36:51] [INFO ] Invariant cache hit.
[2024-05-28 11:36:59] [INFO ] After 8344ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[false, false, false]
Stuttering acceptance computed with spot in 113 ms :[false, false, false]
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 269 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:37:00] [INFO ] Invariant cache hit.
[2024-05-28 11:37:04] [INFO ] Implicit Places using invariants in 4157 ms returned []
Implicit Place search using SMT only with invariants took 4169 ms to find 0 implicit places.
[2024-05-28 11:37:04] [INFO ] Invariant cache hit.
[2024-05-28 11:37:08] [INFO ] Dead Transitions using invariants and state equation in 3701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8142 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[false, false, false]
Finished random walk after 293 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Stuttering acceptance computed with spot in 123 ms :[false, false, false]
Product exploration timeout after 56450 steps with 18686 reset in 10002 ms.
Product exploration timeout after 56900 steps with 18875 reset in 10001 ms.
Built C files in :
/tmp/ltsmin11852649671983067250
[2024-05-28 11:37:30] [INFO ] Built C files in 584ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11852649671983067250
Running compilation step : cd /tmp/ltsmin11852649671983067250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11852649671983067250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11852649671983067250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 266 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:37:34] [INFO ] Invariant cache hit.
[2024-05-28 11:37:37] [INFO ] Implicit Places using invariants in 3671 ms returned []
Implicit Place search using SMT only with invariants took 3674 ms to find 0 implicit places.
[2024-05-28 11:37:37] [INFO ] Invariant cache hit.
[2024-05-28 11:37:41] [INFO ] Dead Transitions using invariants and state equation in 4096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8040 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Built C files in :
/tmp/ltsmin4269687415787978429
[2024-05-28 11:37:42] [INFO ] Built C files in 430ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4269687415787978429
Running compilation step : cd /tmp/ltsmin4269687415787978429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4269687415787978429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4269687415787978429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-28 11:37:48] [INFO ] Flatten gal took : 1778 ms
[2024-05-28 11:37:50] [INFO ] Flatten gal took : 1480 ms
[2024-05-28 11:37:50] [INFO ] Time to serialize gal into /tmp/LTL9503985697131011411.gal : 282 ms
[2024-05-28 11:37:50] [INFO ] Time to serialize properties into /tmp/LTL16908160384528307487.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9503985697131011411.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14124328822891997042.hoa' '-atoms' '/tmp/LTL16908160384528307487.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-05-28 11:38:08] [INFO ] Flatten gal took : 1549 ms
[2024-05-28 11:38:09] [INFO ] Flatten gal took : 1486 ms
[2024-05-28 11:38:10] [INFO ] Time to serialize gal into /tmp/LTL2511668615551392081.gal : 224 ms
[2024-05-28 11:38:10] [INFO ] Time to serialize properties into /tmp/LTL1867809912938702131.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2511668615551392081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1867809912938702131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-28 11:38:26] [INFO ] Flatten gal took : 1689 ms
[2024-05-28 11:38:26] [INFO ] Applying decomposition
[2024-05-28 11:38:28] [INFO ] Flatten gal took : 1533 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13017566305023135373.txt' '-o' '/tmp/graph13017566305023135373.bin' '-w' '/tmp/graph13017566305023135373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13017566305023135373.bin' '-l' '-1' '-v' '-w' '/tmp/graph13017566305023135373.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:38:32] [INFO ] Decomposing Gal with order
[2024-05-28 11:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:38:52] [INFO ] Removed a total of 63355 redundant transitions.
[2024-05-28 11:38:53] [INFO ] Flatten gal took : 10131 ms
[2024-05-28 11:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 3013 labels/synchronizations in 3456 ms.
[2024-05-28 11:38:58] [INFO ] Time to serialize gal into /tmp/LTL771332169428575217.gal : 405 ms
[2024-05-28 11:38:58] [INFO ] Time to serialize properties into /tmp/LTL14956288732939182737.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL771332169428575217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14956288732939182737.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13153066611194946591
[2024-05-28 11:39:14] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13153066611194946591
Running compilation step : cd /tmp/ltsmin13153066611194946591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13153066611194946591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13153066611194946591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-200160-LTLFireability-06 finished in 176656 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(G(!p0)) U (X(G(!p0))&&p1))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 272 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:39:17] [INFO ] Invariant cache hit.
[2024-05-28 11:39:21] [INFO ] Implicit Places using invariants in 3802 ms returned []
Implicit Place search using SMT only with invariants took 3805 ms to find 0 implicit places.
[2024-05-28 11:39:21] [INFO ] Invariant cache hit.
[2024-05-28 11:39:25] [INFO ] Dead Transitions using invariants and state equation in 4216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8295 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s759 1) (EQ s8640 1)), p0:(AND (EQ s649 1) (EQ s2811 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1661 steps with 0 reset in 156 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-08 finished in 8728 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(p0)&&(G(p1)||(p2 U (G(p2)||(p2&&G(!p3)))))))))'
Support contains 6 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 319 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:39:26] [INFO ] Invariant cache hit.
[2024-05-28 11:39:30] [INFO ] Implicit Places using invariants in 4102 ms returned []
Implicit Place search using SMT only with invariants took 4107 ms to find 0 implicit places.
[2024-05-28 11:39:30] [INFO ] Invariant cache hit.
[2024-05-28 11:39:34] [INFO ] Dead Transitions using invariants and state equation in 3734 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8170 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 660 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=(AND p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=7 dest: 9}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p3 p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=p3, acceptance={} source=10 dest: 3}, { cond=(NOT p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) p3), acceptance={} source=11 dest: 3}, { cond=(AND p1 p3), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(AND (OR (EQ s595 0) (EQ s14469 0)) (EQ s32194 0)), p2:(NEQ s20903 1), p3:(AND (EQ s629 1) (EQ s23514 1)), p0:(EQ s20903 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8113 ms.
Product exploration explored 100000 steps with 0 reset in 8126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2))))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 12 states, 37 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1291 ms. (steps per millisecond=7 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-28 11:39:54] [INFO ] Invariant cache hit.
[2024-05-28 11:40:09] [INFO ] [Real]Absence check using 361 positive place invariants in 1404 ms returned sat
[2024-05-28 11:40:09] [INFO ] [Real]Absence check using 361 positive and 200 generalized place invariants in 686 ms returned sat
[2024-05-28 11:40:19] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-28 11:40:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 1477 ms returned sat
[2024-05-28 11:40:35] [INFO ] [Nat]Absence check using 361 positive and 200 generalized place invariants in 1380 ms returned sat
[2024-05-28 11:40:44] [INFO ] After 6946ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :4
[2024-05-28 11:40:44] [INFO ] After 6978ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-28 11:40:44] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :4
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 32961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31282 transitions
Trivial Post-agglo rules discarded 31282 transitions
Performed 31282 trivial Post agglomeration. Transition count delta: 31282
Iterating post reduction 0 with 31282 rules applied. Total rules applied 31282 place count 32961 transition count 33118
Reduce places removed 31282 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 31598 rules applied. Total rules applied 62880 place count 1679 transition count 32802
Reduce places removed 472 places and 0 transitions.
Ensure Unique test removed 31000 transitions
Reduce isomorphic transitions removed 31000 transitions.
Iterating post reduction 2 with 31472 rules applied. Total rules applied 94352 place count 1207 transition count 1802
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 94750 place count 1207 transition count 1404
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 94948 place count 1207 transition count 1404
Applied a total of 94948 rules in 1433 ms. Remains 1207 /32961 variables (removed 31754) and now considering 1404/64400 (removed 62996) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1434 ms. Remains : 1207/32961 places, 1404/64400 transitions.
Finished random walk after 1812 steps, including 0 resets, run visited all 5 properties in 78 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (G (NOT (AND (NOT p1) p2 p3))), (G (NOT (AND p1 (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p2) p3))), (G (NOT (AND (NOT p1) p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (F (AND p1 (NOT p2))), (F (AND p1 p2 p3)), (F (AND p2 p3)), (F (NOT p0)), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT p1)), (F (NOT (AND p1 (NOT p3)))), (F (NOT (AND p1 p2 (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p1 p3))]
Knowledge based reduction with 12 factoid took 775 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 12 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 550 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 557 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Support contains 6 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 272 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:40:48] [INFO ] Invariant cache hit.
[2024-05-28 11:40:52] [INFO ] Implicit Places using invariants in 3788 ms returned []
Implicit Place search using SMT only with invariants took 3789 ms to find 0 implicit places.
[2024-05-28 11:40:52] [INFO ] Invariant cache hit.
[2024-05-28 11:40:56] [INFO ] Dead Transitions using invariants and state equation in 4199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8269 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0 (NOT p3)), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 2 factoid took 276 ms. Reduced automaton from 12 states, 29 edges and 4 AP (stutter sensitive) to 12 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1162 ms. (steps per millisecond=8 ) properties (out of 9) seen :7
Finished Best-First random walk after 9299 steps, including 2 resets, run visited all 2 properties in 68 ms. (steps per millisecond=136 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0 (NOT p3)), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (AND p2 p3)), (F (NOT p0)), (F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (AND p2 (NOT p3)))), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT (AND p1 (NOT p3)))), (F p3)]
Knowledge based reduction with 2 factoid took 437 ms. Reduced automaton from 12 states, 29 edges and 4 AP (stutter sensitive) to 12 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 497 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), p3, (AND (NOT p1) p3)]
Product exploration explored 100000 steps with 0 reset in 9076 ms.
Entered a terminal (fully accepting) state of product in 12449 steps with 4 reset in 1198 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-11 finished in 105466 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(p0)||G(F(p1))))'
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31640 transitions
Trivial Post-agglo rules discarded 31640 transitions
Performed 31640 trivial Post agglomeration. Transition count delta: 31640
Iterating post reduction 0 with 31640 rules applied. Total rules applied 31640 place count 32961 transition count 32760
Reduce places removed 31640 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 31799 rules applied. Total rules applied 63439 place count 1321 transition count 32601
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 2 with 31717 rules applied. Total rules applied 95156 place count 1004 transition count 1201
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 3 with 199 rules applied. Total rules applied 95355 place count 1004 transition count 1002
Applied a total of 95355 rules in 677 ms. Remains 1004 /32961 variables (removed 31957) and now considering 1002/64400 (removed 63398) transitions.
// Phase 1: matrix 1002 rows 1004 cols
[2024-05-28 11:41:12] [INFO ] Computed 403 invariants in 15 ms
[2024-05-28 11:41:12] [INFO ] Implicit Places using invariants in 692 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, 1002]
Discarding 401 places :
Implicit Place search using SMT only with invariants took 696 ms to find 401 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 603/32961 places, 1002/64400 transitions.
Graph (trivial) has 598 edges and 603 vertex of which 399 / 603 are part of one of the 1 SCC in 0 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 7 transition count 208
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 7 transition count 208
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 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 597 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 5 transition count 8
Applied a total of 599 rules in 6 ms. Remains 5 /603 variables (removed 598) and now considering 8/1002 (removed 994) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 11:41:13] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:41:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 11:41:13] [INFO ] Invariant cache hit.
[2024-05-28 11:41:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32961 places, 8/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1425 ms. Remains : 5/32961 places, 8/64400 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1)), p1:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6325 reset in 94 ms.
Product exploration explored 100000 steps with 6158 reset in 87 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 375 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-28 11:41:14] [INFO ] Invariant cache hit.
[2024-05-28 11:41:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 11:41:14] [INFO ] Invariant cache hit.
[2024-05-28 11:41:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 11:41:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 11:41:14] [INFO ] Invariant cache hit.
[2024-05-28 11:41:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 5/5 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6240 reset in 79 ms.
Product exploration explored 100000 steps with 6146 reset in 56 ms.
Built C files in :
/tmp/ltsmin6368779167571991995
[2024-05-28 11:41:15] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-28 11:41:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:41:15] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-28 11:41:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:41:15] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-28 11:41:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:41:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6368779167571991995
Running compilation step : cd /tmp/ltsmin6368779167571991995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin6368779167571991995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6368779167571991995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16059766288095976446.hoa' '--buchi-type=spotba'
LTSmin run took 69 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200160-LTLFireability-12 finished in 3911 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(G(p1)))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 242 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2024-05-28 11:41:16] [INFO ] Computed 561 invariants in 574 ms
[2024-05-28 11:41:20] [INFO ] Implicit Places using invariants in 4750 ms returned []
Implicit Place search using SMT only with invariants took 4752 ms to find 0 implicit places.
[2024-05-28 11:41:20] [INFO ] Invariant cache hit.
[2024-05-28 11:41:24] [INFO ] Dead Transitions using invariants and state equation in 3616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8613 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-13 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s31288 1), p1:(EQ s29887 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-13 finished in 8841 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 p1))) U G(!p2)))'
Support contains 5 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 464 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
[2024-05-28 11:41:24] [INFO ] Invariant cache hit.
[2024-05-28 11:41:28] [INFO ] Implicit Places using invariants in 3697 ms returned []
Implicit Place search using SMT only with invariants took 3698 ms to find 0 implicit places.
[2024-05-28 11:41:28] [INFO ] Invariant cache hit.
[2024-05-28 11:41:32] [INFO ] Dead Transitions using invariants and state equation in 4222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8386 ms. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 254 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1) (NOT p0)), (OR (AND p1 p2) (AND p0 p2))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s721 1) (EQ s21102 1)), p1:(AND (EQ s773 1) (EQ s18087 1)), p0:(EQ s1416 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 1129 steps with 231 reset in 174 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-14 finished in 8933 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))'
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31640 transitions
Trivial Post-agglo rules discarded 31640 transitions
Performed 31640 trivial Post agglomeration. Transition count delta: 31640
Iterating post reduction 0 with 31640 rules applied. Total rules applied 31640 place count 32961 transition count 32760
Reduce places removed 31640 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 31799 rules applied. Total rules applied 63439 place count 1321 transition count 32601
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 2 with 31717 rules applied. Total rules applied 95156 place count 1004 transition count 1201
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 3 with 199 rules applied. Total rules applied 95355 place count 1004 transition count 1002
Applied a total of 95355 rules in 724 ms. Remains 1004 /32961 variables (removed 31957) and now considering 1002/64400 (removed 63398) transitions.
// Phase 1: matrix 1002 rows 1004 cols
[2024-05-28 11:41:34] [INFO ] Computed 403 invariants in 15 ms
[2024-05-28 11:41:34] [INFO ] Implicit Places using invariants in 733 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, 1002]
Discarding 401 places :
Implicit Place search using SMT only with invariants took 741 ms to find 401 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 603/32961 places, 1002/64400 transitions.
Graph (trivial) has 598 edges and 603 vertex of which 399 / 603 are part of one of the 1 SCC in 0 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 7 transition count 208
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 7 transition count 208
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 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 597 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 5 transition count 8
Applied a total of 599 rules in 7 ms. Remains 5 /603 variables (removed 598) and now considering 8/1002 (removed 994) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 11:41:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 11:41:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 11:41:34] [INFO ] Invariant cache hit.
[2024-05-28 11:41:34] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32961 places, 8/64400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1512 ms. Remains : 5/32961 places, 8/64400 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 0) (EQ s0 1) (EQ s2 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-200160-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-15 finished in 1610 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((G(p0)||(p1&&X(p1))))))'
Found a Shortening insensitive property : ServersAndClients-PT-200160-LTLFireability-06
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31641 transitions
Trivial Post-agglo rules discarded 31641 transitions
Performed 31641 trivial Post agglomeration. Transition count delta: 31641
Iterating post reduction 0 with 31641 rules applied. Total rules applied 31641 place count 32961 transition count 32759
Reduce places removed 31641 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 31800 rules applied. Total rules applied 63441 place count 1320 transition count 32600
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 2 with 31918 rules applied. Total rules applied 95359 place count 1002 transition count 1000
Applied a total of 95359 rules in 725 ms. Remains 1002 /32961 variables (removed 31959) and now considering 1000/64400 (removed 63400) transitions.
// Phase 1: matrix 1000 rows 1002 cols
[2024-05-28 11:41:35] [INFO ] Computed 402 invariants in 11 ms
[2024-05-28 11:41:36] [INFO ] Implicit Places using invariants in 743 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 746 ms to find 400 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 602/32961 places, 1000/64400 transitions.
Graph (trivial) has 598 edges and 602 vertex of which 399 / 602 are part of one of the 1 SCC in 1 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 6 transition count 206
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 6 transition count 206
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 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 597 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 4 transition count 6
Applied a total of 599 rules in 4 ms. Remains 4 /602 variables (removed 598) and now considering 6/1000 (removed 994) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 11:41:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:41:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 11:41:36] [INFO ] Invariant cache hit.
[2024-05-28 11:41:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 4/32961 places, 6/64400 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1508 ms. Remains : 4/32961 places, 6/64400 transitions.
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1)), p1:(OR (EQ s0 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25520 reset in 64 ms.
Stack based approach found an accepted trace after 69 steps with 19 reset with depth 3 and stack size 3 in 0 ms.
Treatment of property ServersAndClients-PT-200160-LTLFireability-06 finished in 1806 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-28 11:41:38] [INFO ] Flatten gal took : 1512 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2786564562597920342
[2024-05-28 11:41:39] [INFO ] Too many transitions (64400) to apply POR reductions. Disabling POR matrices.
[2024-05-28 11:41:39] [INFO ] Built C files in 409ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2786564562597920342
Running compilation step : cd /tmp/ltsmin2786564562597920342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 11:41:40] [INFO ] Applying decomposition
[2024-05-28 11:41:42] [INFO ] Flatten gal took : 1801 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15178118457012934676.txt' '-o' '/tmp/graph15178118457012934676.bin' '-w' '/tmp/graph15178118457012934676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15178118457012934676.bin' '-l' '-1' '-v' '-w' '/tmp/graph15178118457012934676.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:41:45] [INFO ] Decomposing Gal with order
[2024-05-28 11:41:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:42:05] [INFO ] Removed a total of 63342 redundant transitions.
[2024-05-28 11:42:07] [INFO ] Flatten gal took : 9861 ms
[2024-05-28 11:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1656 labels/synchronizations in 3152 ms.
[2024-05-28 11:42:11] [INFO ] Time to serialize gal into /tmp/LTLFireability9598363711290374479.gal : 341 ms
[2024-05-28 11:42:11] [INFO ] Time to serialize properties into /tmp/LTLFireability7175177362062379319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9598363711290374479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7175177362062379319.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((u32.sys_req32==1)&&(u314.sv113==1))"))||(("((u32.sys_req32==0)||(u314.sv113==0))")&&(X("((u32.sys_req32==0)||(u314.sv113=...167
Formula 0 simplified : G(F!"((u32.sys_req32==1)&&(u314.sv113==1))" & FG(!"((u32.sys_req32==0)||(u314.sv113==0))" | X!"((u32.sys_req32==0)||(u314.sv113==0))...158
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2786564562597920342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2786564562597920342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-28 12:03:30] [INFO ] Applying decomposition
[2024-05-28 12:03:32] [INFO ] Flatten gal took : 2227 ms
[2024-05-28 12:03:34] [INFO ] Decomposing Gal with order
[2024-05-28 12:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7056652 kB
After kill :
MemTotal: 16393216 kB
MemFree: 7041100 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-200160"
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-200160, 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-171679102300418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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