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.r524-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 ltsminxred
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 r524-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 1717230909105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:35:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:35:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:35:11] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2024-06-01 08:35:11] [INFO ] Transformed 16881 places.
[2024-06-01 08:35:11] [INFO ] Transformed 32400 transitions.
[2024-06-01 08:35:11] [INFO ] Found NUPN structural information;
[2024-06-01 08:35:11] [INFO ] Parsed PT model containing 16881 places and 32400 transitions and 97600 arcs in 933 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 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 272 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2024-06-01 08:35:12] [INFO ] Computed 481 invariants in 637 ms
[2024-06-01 08:35:48] [INFO ] Performed 9444/16881 implicitness test of which 437 returned IMPLICIT in 30 seconds.
[2024-06-01 08:36:04] [INFO ] Implicit Places using invariants in 52880 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 52973 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 116 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 53383 ms. Remains : 16414/16881 places, 32400/32400 transitions.
Support contains 41 out of 16414 places after structural reductions.
[2024-06-01 08:36:06] [INFO ] Flatten gal took : 991 ms
[2024-06-01 08:36:06] [INFO ] Flatten gal took : 715 ms
[2024-06-01 08:36:08] [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 4308 ms. (9 steps per ms) remains 6/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/3 properties
// Phase 1: matrix 32400 rows 16414 cols
[2024-06-01 08:36:17] [INFO ] Computed 14 invariants in 7174 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 16398/16403 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16403 variables, 16398/16406 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16403 variables, 0/16406 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/16414 variables, 11/16417 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16414 variables, 11/16428 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16414 variables, 0/16428 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 12404ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 16414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16414/16414 places, 32400/32400 transitions.
Graph (trivial) has 27198 edges and 16414 vertex of which 13800 / 16414 are part of one of the 1 SCC in 48 ms
Free SCC test removed 13799 places
Drop transitions (Empty/Sink Transition effects.) removed 27198 transitions
Reduce isomorphic transitions removed 27198 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 2599 transitions
Trivial Post-agglo rules discarded 2599 transitions
Performed 2599 trivial Post agglomeration. Transition count delta: 2599
Iterating post reduction 0 with 2601 rules applied. Total rules applied 2602 place count 2614 transition count 2601
Reduce places removed 2612 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2599 transitions
Reduce isomorphic transitions removed 2599 transitions.
Iterating post reduction 1 with 5211 rules applied. Total rules applied 7813 place count 2 transition count 2
Applied a total of 7813 rules in 251 ms. Remains 2 /16414 variables (removed 16412) and now considering 2/32400 (removed 32398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 2/16414 places, 2/32400 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 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 16 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 195 ms. Remains 5 /16414 variables (removed 16409) and now considering 8/32400 (removed 32392) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:36:23] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:36:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:36:23] [INFO ] Invariant cache hit.
[2024-06-01 08:36:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 08:36:23] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:36:23] [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 46 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 50 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 104ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 105ms
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 349 ms. Remains : 5/16414 places, 8/32400 transitions.
Stuttering acceptance computed with spot in 227 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 662 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 186 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-06-01 08:36:31] [INFO ] Computed 14 invariants in 7219 ms
[2024-06-01 08:36:43] [INFO ] Implicit Places using invariants in 19728 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 19749 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 120 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 20056 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 209 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 70 reset in 2904 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 23270 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 107 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-06-01 08:36:47] [INFO ] Invariant cache hit.
[2024-06-01 08:36:59] [INFO ] Implicit Places using invariants in 12702 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 12723 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 89 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 12921 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 161 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 2552 ms.
Stack based approach found an accepted trace after 203 steps with 0 reset with depth 204 and stack size 149 in 8 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-05 finished in 15706 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 102 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-06-01 08:37:03] [INFO ] Invariant cache hit.
[2024-06-01 08:37:15] [INFO ] Implicit Places using invariants in 12611 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 12630 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 107 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 12842 ms. Remains : 16402/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 466 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 3587 ms.
Product exploration explored 100000 steps with 16666 reset in 3542 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 94 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 341 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 1457 ms. (27 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
// Phase 1: matrix 32400 rows 16402 cols
[2024-06-01 08:37:32] [INFO ] Computed 2 invariants in 8294 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, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16399/16402 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16402 variables, 16399/16404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16402 variables, 0/16404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 13404ms, After SMT, problems are : Problem set: 0 solved, 1 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 28 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 333 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 333 ms. Remains : 5/16402 places, 7/32400 transitions.
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 11 steps, saw 4 distinct states, run finished after 6 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 11 steps, saw 4 distinct states, run finished after 2 ms. (steps per millisecond=5 ) properties seen :0
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 178 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 290 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 290 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 108 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-06-01 08:37:39] [INFO ] Invariant cache hit.
[2024-06-01 08:37:42] [INFO ] Implicit Places using invariants in 3288 ms returned []
Implicit Place search using SMT only with invariants took 3289 ms to find 0 implicit places.
Running 32200 sub problems to find dead transitions.
[2024-06-01 08:37:42] [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 164977ms, After SMT, problems are : Problem set: 0 solved, 32200 unsolved
Search for dead transitions found 0 dead transitions in 165265ms
Finished structural reductions in LTL mode , in 1 iterations and 168746 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 90 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 310 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 33952 steps (7 resets) in 952 ms. (35 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 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 293 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 308 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 301 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 3866 ms.
Product exploration explored 100000 steps with 20000 reset in 3751 ms.
Applying partial POR strategy [false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 309 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 11 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 69 ms. Remains 6 /16402 variables (removed 16396) and now considering 9/32400 (removed 32391) transitions.
[2024-06-01 08:40:37] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-06-01 08:40:37] [INFO ] Computed 2 invariants in 4 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-06-01 08:40:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 18 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 89 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 38 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 136ms problems are : Problem set: 1 solved, 4 unsolved
Search for dead transitions found 1 dead transitions in 136ms
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.0 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 216 ms. Remains : 5/16402 places, 8/32400 transitions.
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 137 ms. Remains 16402 /16402 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16402 cols
[2024-06-01 08:40:46] [INFO ] Computed 2 invariants in 8391 ms
[2024-06-01 08:40:50] [INFO ] Implicit Places using invariants in 11787 ms returned []
Implicit Place search using SMT only with invariants took 11789 ms to find 0 implicit places.
Running 32200 sub problems to find dead transitions.
[2024-06-01 08:40:50] [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 170250ms, After SMT, problems are : Problem set: 0 solved, 32200 unsolved
Search for dead transitions found 0 dead transitions in 170586ms
Finished structural reductions in LTL mode , in 1 iterations and 182596 ms. Remains : 16402/16402 places, 32400/32400 transitions.
Treatment of property ServersAndClients-PT-200080-LTLFireability-06 finished in 398994 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 9 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 143 ms. Remains 4 /16414 variables (removed 16410) and now considering 6/32400 (removed 32394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-06-01 08:43:42] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:43:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:43:42] [INFO ] Invariant cache hit.
[2024-06-01 08:43:42] [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-06-01 08:43:42] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:43:42] [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 38 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 40 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 82ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 82ms
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 280 ms. Remains : 4/16414 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 40 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 358 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 113 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-06-01 08:43:49] [INFO ] Computed 14 invariants in 7058 ms
[2024-06-01 08:44:01] [INFO ] Implicit Places using invariants in 18875 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 18893 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 118 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 19125 ms. Remains : 16403/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 228 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 1 reset in 2711 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-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-09 finished in 22130 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 9 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 137 ms. Remains 5 /16414 variables (removed 16409) and now considering 8/32400 (removed 32392) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:44:04] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:44:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:44:04] [INFO ] Invariant cache hit.
[2024-06-01 08:44:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 08:44:04] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:44:04] [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 34 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 31 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 66ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 66ms
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 256 ms. Remains : 5/16414 places, 8/32400 transitions.
Stuttering acceptance computed with spot in 72 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 6413 reset in 130 ms.
Product exploration explored 100000 steps with 6540 reset in 99 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 411 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 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2024-06-01 08:44:05] [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 19 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 22ms 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 487 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 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 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 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 08:44:06] [INFO ] Invariant cache hit.
[2024-06-01 08:44:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 08:44:06] [INFO ] Invariant cache hit.
[2024-06-01 08:44:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 08:44:06] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:44:06] [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 36 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 32 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 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 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 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 42 steps (0 resets) in 5 ms. (7 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 227 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 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6409 reset in 64 ms.
Product exploration explored 100000 steps with 6319 reset in 65 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-06-01 08:44:07] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:44:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:44:07] [INFO ] Invariant cache hit.
[2024-06-01 08:44:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 08:44:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:44:07] [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 35 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 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]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/5 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 4/5 places, 6/8 transitions.
Treatment of property ServersAndClients-PT-200080-LTLFireability-10 finished in 3620 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 135 ms. Remains 4 /16414 variables (removed 16410) and now considering 6/32400 (removed 32394) transitions.
[2024-06-01 08:44:08] [INFO ] Invariant cache hit.
[2024-06-01 08:44:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:44:08] [INFO ] Invariant cache hit.
[2024-06-01 08:44:08] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-06-01 08:44:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:44:08] [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 36 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 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
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 239 ms. Remains : 4/16414 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 57 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 372 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 134 ms. Remains 6 /16414 variables (removed 16408) and now considering 10/32400 (removed 32390) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-06-01 08:44:08] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:44:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:44:08] [INFO ] Invariant cache hit.
[2024-06-01 08:44:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 08:44:08] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 08:44:08] [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 43 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 41 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 87ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 88ms
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 269 ms. Remains : 6/16414 places, 10/32400 transitions.
Stuttering acceptance computed with spot in 87 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 162 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 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 555 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 112 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16414 cols
[2024-06-01 08:44:16] [INFO ] Computed 14 invariants in 7050 ms
[2024-06-01 08:44:27] [INFO ] Implicit Places using invariants in 18270 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 18295 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 127 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 18535 ms. Remains : 16403/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 266 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
Entered a terminal (fully accepting) state of product in 23330 steps with 0 reset in 577 ms.
FORMULA ServersAndClients-PT-200080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-LTLFireability-13 finished in 19452 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 112 ms. Remains 16414 /16414 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
[2024-06-01 08:44:28] [INFO ] Invariant cache hit.
[2024-06-01 08:44:41] [INFO ] Implicit Places using invariants in 12587 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 12602 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 144 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 12859 ms. Remains : 16401/16414 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 101 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 13027 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)))))'
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)))))'
[2024-06-01 08:44:42] [INFO ] Flatten gal took : 570 ms
[2024-06-01 08:44:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 08:44:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16414 places, 32400 transitions and 70000 arcs took 84 ms.
Total runtime 571994 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ServersAndClients-PT-200080-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-200080-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717232373753

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ServersAndClients-PT-200080-LTLFireability-06
ltl formula formula --ltl=/tmp/1349/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16414 places, 32400 transitions and 70000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1349/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1349/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.600 real 1.100 user 1.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1349/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1349/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16416 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16415, there are 32436 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~6 levels ~10000 states ~21292 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16602
pnml2lts-mc( 0/ 4): unique states count: 16602
pnml2lts-mc( 0/ 4): unique transitions count: 32800
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18158
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16745
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16745 states 36018 transitions, fanout: 2.151
pnml2lts-mc( 0/ 4): Total exploration time 435.640 sec (435.570 sec minimum, 435.598 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38, Transitions per second: 83
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 41.9 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.7MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-200080-LTLFireability-10
ltl formula formula --ltl=/tmp/1349/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16414 places, 32400 transitions and 70000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.830 real 1.110 user 1.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1349/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1349/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1349/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1349/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 16415 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16415, there are 32409 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~4 levels ~10000 states ~20596 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 81
pnml2lts-mc( 0/ 4): unique states count: 16481
pnml2lts-mc( 0/ 4): unique transitions count: 32480
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16580
pnml2lts-mc( 0/ 4): - claim success count: 16492
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16496 states 33412 transitions, fanout: 2.025
pnml2lts-mc( 0/ 4): Total exploration time 343.330 sec (343.270 sec minimum, 343.297 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48, Transitions per second: 97
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 41.2 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33384 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.6MB (~258.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r524-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 ;