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.r334-tall-171679080800660.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 itstools
Input is ServersAndClients-PT-200080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080800660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 15:46 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 9.9M 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-200080-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716863488217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 02:31:29] [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 02:31:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:31:30] [INFO ] Load time of PNML (sax parser for PT used): 696 ms
[2024-05-28 02:31:30] [INFO ] Transformed 16881 places.
[2024-05-28 02:31:30] [INFO ] Transformed 32400 transitions.
[2024-05-28 02:31:30] [INFO ] Found NUPN structural information;
[2024-05-28 02:31:30] [INFO ] Parsed PT model containing 16881 places and 32400 transitions and 97600 arcs in 903 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-200080-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 16881 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 269 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2024-05-28 02:31:31] [INFO ] Computed 481 invariants in 477 ms
[2024-05-28 02:32:07] [INFO ] Performed 12861/16881 implicitness test of which 451 returned IMPLICIT in 30 seconds.
[2024-05-28 02:32:15] [INFO ] Implicit Places using invariants in 44207 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, 1203, 1404, 1605, 1806, 2007, 2409, 2610, 2811, 3012, 3213, 3414, 3615, 3816, 4017, 4419, 4620, 4821, 5022, 5223, 5424, 5625, 5826, 6027, 6228, 6831, 7233, 7434, 7635, 7836, 8037, 8238, 8439, 8841, 9042, 9243, 9444, 9645, 10047, 10248, 10650, 11052, 11253, 11454, 11655, 11856, 12057, 12258, 12459, 12660, 12861, 13062, 13263, 13464, 13665, 13866, 14268, 14469, 14670, 14871, 15072, 15273, 15474, 15675, 15876, 16077, 16479]
Discarding 467 places :
Implicit Place search using SMT only with invariants took 44293 ms to find 467 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16414/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 109 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44694 ms. Remains : 16414/16881 places, 32400/32400 transitions.
Support contains 41 out of 16414 places after structural reductions.
[2024-05-28 02:32:16] [INFO ] Flatten gal took : 896 ms
[2024-05-28 02:32:17] [INFO ] Flatten gal took : 667 ms
[2024-05-28 02:32:18] [INFO ] Input system was already deterministic with 32400 transitions.
Support contains 40 out of 16414 places (down from 41) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (8 resets) in 2881 ms. (13 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
// Phase 1: matrix 32400 rows 16414 cols
[2024-05-28 02:32:27] [INFO ] Computed 14 invariants in 7542 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 16394/16404 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16404 variables, 16394/16408 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16404/48814 variables, and 16408 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5139 ms.
Refiners :[Domain max(s): 16404/16414 constraints, Positive P Invariants (semi-flows): 4/14 constraints, State Equation: 0/16414 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 16396/16402 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16402 variables, 16396/16404 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16402/48814 variables, and 16404 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5013 ms.
Refiners :[Domain max(s): 16402/16414 constraints, Positive P Invariants (semi-flows): 2/14 constraints, State Equation: 0/16414 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 17933ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 16414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27190 edges and 16414 vertex of which 13796 / 16414 are part of one of the 1 SCC in 48 ms
Free SCC test removed 13795 places
Drop transitions (Empty/Sink Transition effects.) removed 27190 transitions
Reduce isomorphic transitions removed 27190 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t401 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2598 transitions
Trivial Post-agglo rules discarded 2598 transitions
Performed 2598 trivial Post agglomeration. Transition count delta: 2598
Iterating post reduction 0 with 2600 rules applied. Total rules applied 2601 place count 2618 transition count 2610
Reduce places removed 2610 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2598 transitions
Reduce isomorphic transitions removed 2598 transitions.
Iterating post reduction 1 with 5208 rules applied. Total rules applied 7809 place count 8 transition count 12
Applied a total of 7809 rules in 240 ms. Remains 8 /16414 variables (removed 16406) and now considering 12/32400 (removed 32388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 8/16414 places, 12/32400 transitions.
RANDOM walk for 114 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/6 properties
FORMULA ServersAndClients-PT-200080-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 16414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27130 edges and 16414 vertex of which 13731 / 16414 are part of one of the 1 SCC in 12 ms
Free SCC test removed 13730 places
Ensure Unique test removed 27061 transitions
Reduce isomorphic transitions removed 27061 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2388 transitions
Trivial Post-agglo rules discarded 2388 transitions
Performed 2388 trivial Post agglomeration. Transition count delta: 2388
Iterating post reduction 0 with 2388 rules applied. Total rules applied 2389 place count 2684 transition count 2951
Reduce places removed 2388 places and 0 transitions.
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 4843 rules applied. Total rules applied 7232 place count 296 transition count 496
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 181 rules applied. Total rules applied 7413 place count 205 transition count 406
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 7611 place count 7 transition count 208
Iterating global reduction 3 with 198 rules applied. Total rules applied 7809 place count 7 transition count 208
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 8007 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 4 with 2 rules applied. Total rules applied 8009 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8010 place count 5 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 8011 place count 5 transition count 8
Applied a total of 8011 rules in 175 ms. Remains 5 /16414 variables (removed 16409) and now considering 8/32400 (removed 32392) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 02:32:38] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 02:32:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:32:38] [INFO ] Invariant cache hit.
[2024-05-28 02:32:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:32:38] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-28 02:32:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/16414 places, 8/32400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 5/16414 places, 8/32400 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-02 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||((p2 U (p3||G(p2))) U p0))))'
Support contains 5 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 184 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-05-28 02:32:46] [INFO ] Computed 14 invariants in 7311 ms
[2024-05-28 02:32:58] [INFO ] Implicit Places using invariants in 19617 ms returned [401, 1802, 3803, 6004, 6606, 8207, 9408, 10009, 10410, 13611, 15812, 16213]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 19643 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16402/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 103 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19932 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p3) (NOT p2)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-04
Product exploration explored 100000 steps with 60 reset in 2267 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-04 finished in 22445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 3 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 118 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-05-28 02:33:01] [INFO ] Invariant cache hit.
[2024-05-28 02:33:13] [INFO ] Implicit Places using invariants in 12004 ms returned [401, 1802, 3803, 6004, 6205, 6606, 9408, 10009, 10410, 13611, 15812, 16213]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 12021 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16402/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 100 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12240 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 2067 ms.
Stack based approach found an accepted trace after 1959 steps with 0 reset with depth 1960 and stack size 843 in 42 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-05 finished in 14556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p0))))||G(p1)))))'
Support contains 3 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 89 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-05-28 02:33:16] [INFO ] Invariant cache hit.
[2024-05-28 02:33:27] [INFO ] Implicit Places using invariants in 11880 ms returned [401, 1802, 3803, 6004, 6606, 8207, 9408, 10009, 10410, 13611, 15812, 16213]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 11896 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16402/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 86 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12073 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-06
Product exploration explored 100000 steps with 16666 reset in 3241 ms.
Product exploration explored 100000 steps with 16666 reset in 3240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1041 ms. (38 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
// Phase 1: matrix 32400 rows 16402 cols
[2024-05-28 02:33:44] [INFO ] Computed 2 invariants in 8571 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 16399/16402 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16402 variables, 16399/16404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16402 variables, 0/16404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 13724ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 16402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16402/16402 places, 32400/32400 transitions.
Graph (trivial) has 31918 edges and 16402 vertex of which 16119 / 16402 are part of one of the 1 SCC in 12 ms
Free SCC test removed 16118 places
Drop transitions (Empty/Sink Transition effects.) removed 31838 transitions
Reduce isomorphic transitions removed 31838 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 284 transition count 483
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 237 place count 205 transition count 405
Discarding 198 places :
Symmetric choice reduction at 2 with 198 rule applications. Total rules 435 place count 7 transition count 207
Iterating global reduction 2 with 198 rules applied. Total rules applied 633 place count 7 transition count 207
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 831 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 6 transition count 8
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 834 place count 5 transition count 7
Iterating global reduction 3 with 1 rules applied. Total rules applied 835 place count 5 transition count 7
Applied a total of 835 rules in 232 ms. Remains 5 /16402 variables (removed 16397) and now considering 7/32400 (removed 32393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 5/16402 places, 7/32400 transitions.
RANDOM walk for 40000 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 5 cols
[2024-05-28 02:33:49] [INFO ] Computed 2 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 5/12 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 16402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16402/16402 places, 32400/32400 transitions.
Applied a total of 0 rules in 84 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16402 cols
[2024-05-28 02:33:59] [INFO ] Computed 2 invariants in 8668 ms
[2024-05-28 02:34:02] [INFO ] Implicit Places using invariants in 11777 ms returned []
Implicit Place search using SMT only with invariants took 11779 ms to find 0 implicit places.
Running 32200 sub problems to find dead transitions.
[2024-05-28 02:34:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16401 variables, 16401/16401 constraints. Problems are: Problem set: 0 solved, 32200 unsolved
SMT process timed out in 142484ms, After SMT, problems are : Problem set: 0 solved, 32200 unsolved
Search for dead transitions found 0 dead transitions in 142771ms
Finished structural reductions in LTL mode , in 1 iterations and 154710 ms. Remains : 16402/16402 places, 32400/32400 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 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1087 ms. (36 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-28 02:36:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16400/16401 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16401 variables, 16400/16402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16401 variables, 0/16402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/16402 variables, 1/16403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16402 variables, 1/16404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16402 variables, 0/16404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5076ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 16402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16402/16402 places, 32400/32400 transitions.
Graph (trivial) has 31998 edges and 16402 vertex of which 16200 / 16402 are part of one of the 1 SCC in 10 ms
Free SCC test removed 16199 places
Drop transitions (Empty/Sink Transition effects.) removed 31998 transitions
Reduce isomorphic transitions removed 31998 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12001 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 202 transition count 201
Reduce places removed 200 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 601 place count 2 transition count 2
Applied a total of 601 rules in 48 ms. Remains 2 /16402 variables (removed 16400) and now considering 2/32400 (removed 32398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 2/16402 places, 2/32400 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20000 reset in 3100 ms.
Product exploration explored 100000 steps with 20000 reset in 3083 ms.
Applying partial POR strategy [false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 16402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16402/16402 places, 32400/32400 transitions.
Graph (trivial) has 31918 edges and 16402 vertex of which 16119 / 16402 are part of one of the 1 SCC in 8 ms
Free SCC test removed 16118 places
Ensure Unique test removed 31837 transitions
Reduce isomorphic transitions removed 31837 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 284 transition count 563
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 284 transition count 485
Discarding 276 places :
Symmetric choice reduction at 2 with 276 rule applications. Total rules 434 place count 8 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 276 rules applied. Total rules applied 710 place count 8 transition count 209
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 908 place count 8 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 909 place count 8 transition count 11
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 911 place count 6 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 913 place count 6 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 913 rules in 55 ms. Remains 6 /16402 variables (removed 16396) and now considering 9/32400 (removed 32391) transitions.
[2024-05-28 02:36:38] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-05-28 02:36:38] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 02:36:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/14 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 9 constraints, problems are : Problem set: 1 solved, 4 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/14 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 1 solved, 4 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 4 unsolved
Search for dead transitions found 1 dead transitions in 118ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 6/16402 places, 8/32400 transitions.
Graph (complete) has 10 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/16402 places, 8/32400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 5/16402 places, 8/32400 transitions.
Built C files in :
/tmp/ltsmin13949859437682794621
[2024-05-28 02:36:39] [INFO ] Built C files in 323ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13949859437682794621
Running compilation step : cd /tmp/ltsmin13949859437682794621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13949859437682794621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13949859437682794621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 16402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16402/16402 places, 32400/32400 transitions.
Applied a total of 0 rules in 102 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16402 cols
[2024-05-28 02:36:51] [INFO ] Computed 2 invariants in 8567 ms
[2024-05-28 02:36:54] [INFO ] Implicit Places using invariants in 11623 ms returned []
Implicit Place search using SMT only with invariants took 11624 ms to find 0 implicit places.
Running 32200 sub problems to find dead transitions.
[2024-05-28 02:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16401 variables, 16401/16401 constraints. Problems are: Problem set: 0 solved, 32200 unsolved
SMT process timed out in 150635ms, After SMT, problems are : Problem set: 0 solved, 32200 unsolved
Search for dead transitions found 0 dead transitions in 150907ms
Finished structural reductions in LTL mode , in 1 iterations and 162706 ms. Remains : 16402/16402 places, 32400/32400 transitions.
Built C files in :
/tmp/ltsmin2763948315624411764
[2024-05-28 02:39:25] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2763948315624411764
Running compilation step : cd /tmp/ltsmin2763948315624411764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2763948315624411764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2763948315624411764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 02:39:29] [INFO ] Flatten gal took : 508 ms
[2024-05-28 02:39:30] [INFO ] Flatten gal took : 506 ms
[2024-05-28 02:39:30] [INFO ] Time to serialize gal into /tmp/LTL16798496263299952281.gal : 132 ms
[2024-05-28 02:39:30] [INFO ] Time to serialize properties into /tmp/LTL629164831997912082.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16798496263299952281.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16254443691573110834.hoa' '-atoms' '/tmp/LTL629164831997912082.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL629164831997912082.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16254443691573110834.hoa
Detected timeout of ITS tools.
[2024-05-28 02:39:46] [INFO ] Flatten gal took : 472 ms
[2024-05-28 02:39:46] [INFO ] Flatten gal took : 499 ms
[2024-05-28 02:39:46] [INFO ] Time to serialize gal into /tmp/LTL12495690599710242829.gal : 85 ms
[2024-05-28 02:39:46] [INFO ] Time to serialize properties into /tmp/LTL18187075861829318331.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12495690599710242829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18187075861829318331.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(X(F("(sv36_c184==0)")))))||(G("((sys_req115==0)||(sv29==0))"))))))
Formula 0 simplified : XX(XXXG!"(sv36_c184==0)" & F!"((sys_req115==0)||(sv29==0))")
Detected timeout of ITS tools.
[2024-05-28 02:40:02] [INFO ] Flatten gal took : 457 ms
[2024-05-28 02:40:02] [INFO ] Applying decomposition
[2024-05-28 02:40:02] [INFO ] Flatten gal took : 484 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13480819530156252355.txt' '-o' '/tmp/graph13480819530156252355.bin' '-w' '/tmp/graph13480819530156252355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13480819530156252355.bin' '-l' '-1' '-v' '-w' '/tmp/graph13480819530156252355.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:40:04] [INFO ] Decomposing Gal with order
[2024-05-28 02:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:40:08] [INFO ] Removed a total of 674 redundant transitions.
[2024-05-28 02:40:08] [INFO ] Flatten gal took : 752 ms
[2024-05-28 02:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-28 02:40:08] [INFO ] Time to serialize gal into /tmp/LTL15849658367368680273.gal : 111 ms
[2024-05-28 02:40:08] [INFO ] Time to serialize properties into /tmp/LTL18113322301316371877.ltl : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15849658367368680273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18113322301316371877.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(X(F("(u181.sv36_c184==0)")))))||(G("((u115.sys_req115==0)||(u200.sv29==0))"))))))
Formula 0 simplified : XX(XXXG!"(u181.sv36_c184==0)" & F!"((u115.sys_req115==0)||(u200.sv29==0))")
Detected timeout of ITS tools.
Treatment of property ServersAndClients-PT-200080-LTLFireability-06 finished in 427669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 16414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27132 edges and 16414 vertex of which 13732 / 16414 are part of one of the 1 SCC in 7 ms
Free SCC test removed 13731 places
Ensure Unique test removed 27063 transitions
Reduce isomorphic transitions removed 27063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2388 transitions
Trivial Post-agglo rules discarded 2388 transitions
Performed 2388 trivial Post agglomeration. Transition count delta: 2388
Iterating post reduction 0 with 2388 rules applied. Total rules applied 2389 place count 2683 transition count 2949
Reduce places removed 2388 places and 0 transitions.
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 4843 rules applied. Total rules applied 7232 place count 295 transition count 494
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 181 rules applied. Total rules applied 7413 place count 204 transition count 404
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 7611 place count 6 transition count 206
Iterating global reduction 3 with 198 rules applied. Total rules applied 7809 place count 6 transition count 206
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 8007 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 4 with 2 rules applied. Total rules applied 8009 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8010 place count 4 transition count 6
Iterating global reduction 4 with 1 rules applied. Total rules applied 8011 place count 4 transition count 6
Applied a total of 8011 rules in 131 ms. Remains 4 /16414 variables (removed 16410) and now considering 6/32400 (removed 32394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 02:40:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 02:40:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:40:23] [INFO ] Invariant cache hit.
[2024-05-28 02:40:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-28 02:40:23] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 02:40:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16414 places, 6/32400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 4/16414 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-08 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))||(p2 U X((p3 U p0)))))'
Support contains 6 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 103 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-05-28 02:40:31] [INFO ] Computed 14 invariants in 7327 ms
[2024-05-28 02:40:43] [INFO ] Implicit Places using invariants in 19084 ms returned [1802, 3803, 6004, 6205, 6606, 8207, 9408, 10009, 13611, 15812, 16213]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 19096 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16403/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 105 ms. Remains 16403 /16403 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19304 ms. Remains : 16403/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-09
Product exploration explored 100000 steps with 5 reset in 2029 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-09 finished in 21623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 16414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27130 edges and 16414 vertex of which 13731 / 16414 are part of one of the 1 SCC in 6 ms
Free SCC test removed 13730 places
Ensure Unique test removed 27061 transitions
Reduce isomorphic transitions removed 27061 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2388 transitions
Trivial Post-agglo rules discarded 2388 transitions
Performed 2388 trivial Post agglomeration. Transition count delta: 2388
Iterating post reduction 0 with 2388 rules applied. Total rules applied 2389 place count 2684 transition count 2951
Reduce places removed 2388 places and 0 transitions.
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 4843 rules applied. Total rules applied 7232 place count 296 transition count 496
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 181 rules applied. Total rules applied 7413 place count 205 transition count 406
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 7611 place count 7 transition count 208
Iterating global reduction 3 with 198 rules applied. Total rules applied 7809 place count 7 transition count 208
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 8007 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 4 with 2 rules applied. Total rules applied 8009 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8010 place count 5 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 8011 place count 5 transition count 8
Applied a total of 8011 rules in 128 ms. Remains 5 /16414 variables (removed 16409) and now considering 8/32400 (removed 32392) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 02:40:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 02:40:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:40:45] [INFO ] Invariant cache hit.
[2024-05-28 02:40:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:40:45] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-28 02:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/16414 places, 8/32400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 5/16414 places, 8/32400 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-10
Product exploration explored 100000 steps with 6513 reset in 118 ms.
Product exploration explored 100000 steps with 6482 reset in 98 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 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-28 02:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 466 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 375 ms :[(NOT p1), (NOT p1)]
Support contains 2 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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-28 02:40:47] [INFO ] Invariant cache hit.
[2024-05-28 02:40:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:40:47] [INFO ] Invariant cache hit.
[2024-05-28 02:40:47] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 02:40:47] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-28 02:40:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 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 163 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 63 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
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 199 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 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6450 reset in 59 ms.
Product exploration explored 100000 steps with 6531 reset in 58 ms.
Built C files in :
/tmp/ltsmin5863532452754894698
[2024-05-28 02:40:48] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-28 02:40:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:40:48] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-28 02:40:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:40:48] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-28 02:40:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:40:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5863532452754894698
Running compilation step : cd /tmp/ltsmin5863532452754894698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 123 ms.
Running link step : cd /tmp/ltsmin5863532452754894698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5863532452754894698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased56648493916140583.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200080-LTLFireability-10 finished in 3240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 16414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27132 edges and 16414 vertex of which 13732 / 16414 are part of one of the 1 SCC in 8 ms
Free SCC test removed 13731 places
Ensure Unique test removed 27063 transitions
Reduce isomorphic transitions removed 27063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2388 transitions
Trivial Post-agglo rules discarded 2388 transitions
Performed 2388 trivial Post agglomeration. Transition count delta: 2388
Iterating post reduction 0 with 2388 rules applied. Total rules applied 2389 place count 2683 transition count 2949
Reduce places removed 2388 places and 0 transitions.
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 4843 rules applied. Total rules applied 7232 place count 295 transition count 494
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 181 rules applied. Total rules applied 7413 place count 204 transition count 404
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 7611 place count 6 transition count 206
Iterating global reduction 3 with 198 rules applied. Total rules applied 7809 place count 6 transition count 206
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 8007 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 4 with 2 rules applied. Total rules applied 8009 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8010 place count 4 transition count 6
Iterating global reduction 4 with 1 rules applied. Total rules applied 8011 place count 4 transition count 6
Applied a total of 8011 rules in 127 ms. Remains 4 /16414 variables (removed 16410) and now considering 6/32400 (removed 32394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 02:40:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 02:40:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:40:48] [INFO ] Invariant cache hit.
[2024-05-28 02:40:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:40:48] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 02:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16414 places, 6/32400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 4/16414 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-11 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G((p2 U p3)))))'
Support contains 4 out of 16414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27128 edges and 16414 vertex of which 13730 / 16414 are part of one of the 1 SCC in 8 ms
Free SCC test removed 13729 places
Ensure Unique test removed 27059 transitions
Reduce isomorphic transitions removed 27059 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2388 transitions
Trivial Post-agglo rules discarded 2388 transitions
Performed 2388 trivial Post agglomeration. Transition count delta: 2388
Iterating post reduction 0 with 2388 rules applied. Total rules applied 2389 place count 2685 transition count 2953
Reduce places removed 2388 places and 0 transitions.
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 4843 rules applied. Total rules applied 7232 place count 297 transition count 498
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 181 rules applied. Total rules applied 7413 place count 206 transition count 408
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 7611 place count 8 transition count 210
Iterating global reduction 3 with 198 rules applied. Total rules applied 7809 place count 8 transition count 210
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 8007 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8009 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8010 place count 6 transition count 10
Iterating global reduction 4 with 1 rules applied. Total rules applied 8011 place count 6 transition count 10
Applied a total of 8011 rules in 181 ms. Remains 6 /16414 variables (removed 16408) and now considering 10/32400 (removed 32390) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-05-28 02:40:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 02:40:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:40:49] [INFO ] Invariant cache hit.
[2024-05-28 02:40:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 02:40:49] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 02:40:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/16414 places, 10/32400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 6/16414 places, 10/32400 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 163 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-12 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U G(p1)) U G(p2))))'
Support contains 5 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 98 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-05-28 02:40:57] [INFO ] Computed 14 invariants in 7536 ms
[2024-05-28 02:41:09] [INFO ] Implicit Places using invariants in 19228 ms returned [401, 3803, 6004, 6205, 6606, 8207, 9408, 10009, 10410, 13611, 15812]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 19254 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16403/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 112 ms. Remains 16403 /16403 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19464 ms. Remains : 16403/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 2421 ms.
Entered a terminal (fully accepting) state of product in 27798 steps with 0 reset in 692 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-13 finished in 22923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 16414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 96 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-05-28 02:41:12] [INFO ] Invariant cache hit.
[2024-05-28 02:41:25] [INFO ] Implicit Places using invariants in 12719 ms returned [401, 1802, 3803, 6004, 6205, 6606, 8207, 9408, 10009, 10410, 13611, 15812, 16213]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 12731 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16401/16414 places, 32400/32400 transitions.
Applied a total of 0 rules in 93 ms. Remains 16401 /16401 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12921 ms. Remains : 16401/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-14 finished in 13068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p0))))||G(p1)))))'
[2024-05-28 02:41:26] [INFO ] Flatten gal took : 500 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6224082915041327786
[2024-05-28 02:41:26] [INFO ] Too many transitions (32400) to apply POR reductions. Disabling POR matrices.
[2024-05-28 02:41:26] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6224082915041327786
Running compilation step : cd /tmp/ltsmin6224082915041327786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 02:41:27] [INFO ] Applying decomposition
[2024-05-28 02:41:27] [INFO ] Flatten gal took : 539 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11630015438414788893.txt' '-o' '/tmp/graph11630015438414788893.bin' '-w' '/tmp/graph11630015438414788893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11630015438414788893.bin' '-l' '-1' '-v' '-w' '/tmp/graph11630015438414788893.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:41:28] [INFO ] Decomposing Gal with order
[2024-05-28 02:41:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:41:32] [INFO ] Removed a total of 5170 redundant transitions.
[2024-05-28 02:41:33] [INFO ] Flatten gal took : 886 ms
[2024-05-28 02:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2024-05-28 02:41:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10034382942830007169.gal : 101 ms
[2024-05-28 02:41:33] [INFO ] Time to serialize properties into /tmp/LTLFireability5669151607833348535.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10034382942830007169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5669151607833348535.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(X(F("(u182.sv36_c184==0)")))))||(G("((u114.sys_req115==0)||(u204.sv29==0))"))))))
Formula 0 simplified : XX(XXXG!"(u182.sv36_c184==0)" & F!"((u114.sys_req115==0)||(u204.sv29==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 items max in DFS search stack
15219 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,154.42,283700,1,0,102956,211744,44322,500324,11221,607348,1263882
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-200080-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 759210 ms.

BK_STOP 1716864248563

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-200080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ServersAndClients-PT-200080, 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 r334-tall-171679080800660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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