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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 15:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 13 15:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M 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-100040-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717230078157

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-100040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:21:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:21:19] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-06-01 08:21:19] [INFO ] Transformed 4441 places.
[2024-06-01 08:21:19] [INFO ] Transformed 8200 transitions.
[2024-06-01 08:21:19] [INFO ] Found NUPN structural information;
[2024-06-01 08:21:19] [INFO ] Parsed PT model containing 4441 places and 8200 transitions and 24800 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100040-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 630 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-06-01 08:21:20] [INFO ] Computed 241 invariants in 124 ms
[2024-06-01 08:21:27] [INFO ] Implicit Places using invariants in 6854 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502, 603, 704, 805, 906, 1007, 1108, 1209, 1512, 1613, 1714, 1815, 2017, 2118, 2219, 2320, 2421, 2724, 2825, 2926, 3229, 3532, 3835, 3936, 4037, 4138, 4340]
Discarding 227 places :
Implicit Place search using SMT only with invariants took 6906 ms to find 227 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4214/4441 places, 8200/8200 transitions.
Discarding 2685 places :
Symmetric choice reduction at 0 with 2685 rule applications. Total rules 2685 place count 1529 transition count 5515
Iterating global reduction 0 with 2685 rules applied. Total rules applied 5370 place count 1529 transition count 5515
Ensure Unique test removed 2586 transitions
Reduce isomorphic transitions removed 2586 transitions.
Iterating post reduction 0 with 2586 rules applied. Total rules applied 7956 place count 1529 transition count 2929
Discarding 1379 places :
Symmetric choice reduction at 1 with 1379 rule applications. Total rules 9335 place count 150 transition count 1550
Iterating global reduction 1 with 1379 rules applied. Total rules applied 10714 place count 150 transition count 1550
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 10781 place count 83 transition count 612
Iterating global reduction 1 with 67 rules applied. Total rules applied 10848 place count 83 transition count 612
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 10915 place count 83 transition count 545
Applied a total of 10915 rules in 447 ms. Remains 83 /4214 variables (removed 4131) and now considering 545/8200 (removed 7655) transitions.
// Phase 1: matrix 545 rows 83 cols
[2024-06-01 08:21:27] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 08:21:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 08:21:28] [INFO ] Invariant cache hit.
[2024-06-01 08:21:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 83/4441 places, 545/8200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8202 ms. Remains : 83/4441 places, 545/8200 transitions.
Support contains 48 out of 83 places after structural reductions.
[2024-06-01 08:21:28] [INFO ] Flatten gal took : 83 ms
[2024-06-01 08:21:28] [INFO ] Flatten gal took : 35 ms
[2024-06-01 08:21:28] [INFO ] Input system was already deterministic with 545 transitions.
Support contains 46 out of 83 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1792 ms. (22 steps per ms) remains 2/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2024-06-01 08:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 71/628 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, State Equation: 0/83 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Graph (trivial) has 92 edges and 83 vertex of which 48 / 83 are part of one of the 1 SCC in 2 ms
Free SCC test removed 47 places
Ensure Unique test removed 487 transitions
Reduce isomorphic transitions removed 487 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 36 transition count 52
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 30 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 29 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 29 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 29 transition count 49
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 53 place count 5 transition count 37
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 82 place count 5 transition count 8
Applied a total of 82 rules in 21 ms. Remains 5 /83 variables (removed 78) and now considering 8/545 (removed 537) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:21:30] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:21:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 08:21:30] [INFO ] Invariant cache hit.
[2024-06-01 08:21:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 08:21:30] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:21:30] [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 69 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 48 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 134ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/83 places, 8/545 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 5/83 places, 8/545 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-00 finished in 472 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' '!(G(F(G((X(p0) U p1)))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 53 transition count 372
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 53 transition count 372
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 84 place count 53 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 103 place count 34 transition count 82
Iterating global reduction 1 with 19 rules applied. Total rules applied 122 place count 34 transition count 82
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 141 place count 34 transition count 63
Applied a total of 141 rules in 4 ms. Remains 34 /83 variables (removed 49) and now considering 63/545 (removed 482) transitions.
// Phase 1: matrix 63 rows 34 cols
[2024-06-01 08:21:30] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 08:21:30] [INFO ] Implicit Places using invariants in 79 ms returned [5, 9, 11, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 90 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/83 places, 63/545 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8 transition count 50
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8 transition count 50
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 64 place count 8 transition count 12
Applied a total of 64 rules in 0 ms. Remains 8 /21 variables (removed 13) and now considering 12/63 (removed 51) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 08:21:30] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:21:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 08:21:30] [INFO ] Invariant cache hit.
[2024-06-01 08:21:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/83 places, 12/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 8/83 places, 12/545 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 312 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 4 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-02 finished in 616 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' '!(G(F(p0)))'
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Graph (trivial) has 94 edges and 83 vertex of which 49 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 35 transition count 23
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 74 place count 2 transition count 3
Applied a total of 74 rules in 2 ms. Remains 2 /83 variables (removed 81) and now considering 3/545 (removed 542) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 08:21:31] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:21:31] [INFO ] Invariant cache hit.
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 08:21:31] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:21:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 47ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/83 places, 3/545 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 2/83 places, 3/545 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-03 finished in 266 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(G((p0||G(p1)))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 53 transition count 372
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 53 transition count 372
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 84 place count 53 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 103 place count 34 transition count 82
Iterating global reduction 1 with 19 rules applied. Total rules applied 122 place count 34 transition count 82
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 141 place count 34 transition count 63
Applied a total of 141 rules in 5 ms. Remains 34 /83 variables (removed 49) and now considering 63/545 (removed 482) transitions.
// Phase 1: matrix 63 rows 34 cols
[2024-06-01 08:21:31] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants in 39 ms returned [5, 9, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 41 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/83 places, 63/545 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8 transition count 50
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8 transition count 50
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 64 place count 8 transition count 12
Applied a total of 64 rules in 1 ms. Remains 8 /21 variables (removed 13) and now considering 12/63 (removed 51) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 08:21:31] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:21:31] [INFO ] Invariant cache hit.
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/83 places, 12/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 8/83 places, 12/545 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-04
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-04 finished in 286 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(G((p0&&F(G(p1))&&F(p2))))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 53 transition count 385
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 53 transition count 385
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 83 place count 53 transition count 362
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 102 place count 34 transition count 96
Iterating global reduction 1 with 19 rules applied. Total rules applied 121 place count 34 transition count 96
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 140 place count 34 transition count 77
Applied a total of 140 rules in 3 ms. Remains 34 /83 variables (removed 49) and now considering 77/545 (removed 468) transitions.
// Phase 1: matrix 77 rows 34 cols
[2024-06-01 08:21:31] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants in 52 ms returned [6, 10, 12, 14, 16, 18, 20, 26, 28, 30, 32]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 53 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/83 places, 77/545 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 12 transition count 66
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 12 transition count 66
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 66 place count 12 transition count 22
Applied a total of 66 rules in 1 ms. Remains 12 /23 variables (removed 11) and now considering 22/77 (removed 55) transitions.
// Phase 1: matrix 22 rows 12 cols
[2024-06-01 08:21:31] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:21:31] [INFO ] Invariant cache hit.
[2024-06-01 08:21:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/83 places, 22/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 12/83 places, 22/545 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-05 finished in 368 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 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Graph (trivial) has 96 edges and 83 vertex of which 50 / 83 are part of one of the 1 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 34 transition count 22
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 69 place count 3 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 3 transition count 3
Applied a total of 70 rules in 6 ms. Remains 3 /83 variables (removed 80) and now considering 3/545 (removed 542) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 08:21:32] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:21:32] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/83 places, 3/545 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25 ms. Remains : 2/83 places, 3/545 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-06 finished in 70 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' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Graph (trivial) has 89 edges and 83 vertex of which 46 / 83 are part of one of the 1 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 457 transitions
Reduce isomorphic transitions removed 457 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 38 transition count 83
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 33 transition count 81
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 32 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 30 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 30 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 30 transition count 76
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 51 place count 10 transition count 66
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 95 place count 10 transition count 22
Applied a total of 95 rules in 8 ms. Remains 10 /83 variables (removed 73) and now considering 22/545 (removed 523) transitions.
// Phase 1: matrix 22 rows 10 cols
[2024-06-01 08:21:32] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 08:21:32] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:21:32] [INFO ] Invariant cache hit.
[2024-06-01 08:21:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 08:21:32] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/83 places, 22/545 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 10/83 places, 22/545 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-07 finished in 602 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 U G(p1))||G(p2))))'
Support contains 3 out of 83 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 : 83/83 places, 545/545 transitions.
Graph (trivial) has 89 edges and 83 vertex of which 46 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 45 places
Ensure Unique test removed 470 transitions
Reduce isomorphic transitions removed 470 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 68
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 31 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 30 transition count 65
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 52 place count 8 transition count 54
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 91 place count 8 transition count 15
Applied a total of 91 rules in 6 ms. Remains 8 /83 variables (removed 75) and now considering 15/545 (removed 530) transitions.
// Phase 1: matrix 15 rows 8 cols
[2024-06-01 08:21:32] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:21:32] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:21:32] [INFO ] Invariant cache hit.
[2024-06-01 08:21:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 08:21:32] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 08:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/22 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/22 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/83 places, 15/545 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 8/83 places, 15/545 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 156 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 6 in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-08 finished in 410 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(F(((p0&&X(p1))||G(p1))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 53 transition count 372
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 53 transition count 372
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 83 place count 53 transition count 349
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 102 place count 34 transition count 83
Iterating global reduction 1 with 19 rules applied. Total rules applied 121 place count 34 transition count 83
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 140 place count 34 transition count 64
Applied a total of 140 rules in 3 ms. Remains 34 /83 variables (removed 49) and now considering 64/545 (removed 481) transitions.
// Phase 1: matrix 64 rows 34 cols
[2024-06-01 08:21:33] [INFO ] Computed 14 invariants in 0 ms
[2024-06-01 08:21:33] [INFO ] Implicit Places using invariants in 45 ms returned [5, 8, 10, 12, 14, 16, 19, 21, 24, 26, 28, 30, 32]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 58 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/83 places, 64/545 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8 transition count 51
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8 transition count 51
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 65 place count 8 transition count 12
Applied a total of 65 rules in 0 ms. Remains 8 /21 variables (removed 13) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 08:21:33] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 08:21:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:21:33] [INFO ] Invariant cache hit.
[2024-06-01 08:21:33] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/83 places, 12/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 8/83 places, 12/545 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-09
Product exploration explored 100000 steps with 24003 reset in 123 ms.
Product exploration explored 100000 steps with 24015 reset in 96 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 (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-06-01 08:21:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 8/20 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 444 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 08:21:34] [INFO ] Invariant cache hit.
[2024-06-01 08:21:34] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:21:34] [INFO ] Invariant cache hit.
[2024-06-01 08:21:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 08:21:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 8/8 places, 12/12 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 : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 172 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 24003 reset in 41 ms.
Product exploration explored 100000 steps with 24007 reset in 54 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 12/12 transitions.
Graph (trivial) has 8 edges and 8 vertex of which 6 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /8 variables (removed 5) and now considering 5/12 (removed 7) transitions.
[2024-06-01 08:21:36] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 08:21:36] [INFO ] Computed 1 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 55ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/8 places, 5/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 3/8 places, 5/12 transitions.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 08:21:36] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:21:36] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 08:21:36] [INFO ] Invariant cache hit.
[2024-06-01 08:21:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 08:21:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 8/8 places, 12/12 transitions.
Treatment of property ServersAndClients-PT-100040-LTLFireability-09 finished in 3737 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((X((p1||X(X(p2))))||p0))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 54 transition count 399
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 54 transition count 399
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 80 place count 54 transition count 377
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 34 transition count 97
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 34 transition count 97
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 140 place count 34 transition count 77
Applied a total of 140 rules in 6 ms. Remains 34 /83 variables (removed 49) and now considering 77/545 (removed 468) transitions.
// Phase 1: matrix 77 rows 34 cols
[2024-06-01 08:21:36] [INFO ] Computed 14 invariants in 0 ms
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants in 321 ms returned [6, 10, 12, 16, 18, 20, 22, 24, 26, 28, 30]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 322 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/83 places, 77/545 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 12 transition count 66
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 12 transition count 66
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 66 place count 12 transition count 22
Applied a total of 66 rules in 0 ms. Remains 12 /23 variables (removed 11) and now considering 22/77 (removed 55) transitions.
// Phase 1: matrix 22 rows 12 cols
[2024-06-01 08:21:37] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:21:37] [INFO ] Invariant cache hit.
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/83 places, 22/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 369 ms. Remains : 12/83 places, 22/545 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-12
Product exploration explored 100000 steps with 44382 reset in 45 ms.
Product exploration explored 100000 steps with 44421 reset in 58 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100040-LTLFireability-12 finished in 712 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&&(X(p2)||F(p3)||p1))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 54 transition count 386
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 54 transition count 386
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 82 place count 54 transition count 362
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 101 place count 35 transition count 96
Iterating global reduction 1 with 19 rules applied. Total rules applied 120 place count 35 transition count 96
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 139 place count 35 transition count 77
Applied a total of 139 rules in 5 ms. Remains 35 /83 variables (removed 48) and now considering 77/545 (removed 468) transitions.
// Phase 1: matrix 77 rows 35 cols
[2024-06-01 08:21:37] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants in 46 ms returned [6, 9, 11, 13, 15, 21, 23, 25, 27, 29, 31, 33]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 48 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/83 places, 77/545 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 11 transition count 65
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 11 transition count 65
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 72 place count 11 transition count 17
Applied a total of 72 rules in 1 ms. Remains 11 /23 variables (removed 12) and now considering 17/77 (removed 60) transitions.
// Phase 1: matrix 17 rows 11 cols
[2024-06-01 08:21:37] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:21:37] [INFO ] Invariant cache hit.
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/83 places, 17/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 11/83 places, 17/545 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-13
Product exploration explored 100000 steps with 9828 reset in 46 ms.
Stack based approach found an accepted trace after 16 steps with 5 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-13 finished in 341 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((G(p0)||(p0&&F((p1||(!p2&&X(p3)))))))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 55 transition count 387
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 55 transition count 387
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 78 place count 55 transition count 365
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 37 transition count 113
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 37 transition count 113
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 132 place count 37 transition count 95
Applied a total of 132 rules in 11 ms. Remains 37 /83 variables (removed 46) and now considering 95/545 (removed 450) transitions.
// Phase 1: matrix 95 rows 37 cols
[2024-06-01 08:21:37] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants in 91 ms returned [7, 10, 12, 14, 17, 19, 22, 25, 27, 31, 33, 35]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 93 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/83 places, 95/545 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 13 transition count 83
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 13 transition count 83
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 83 place count 13 transition count 24
Applied a total of 83 rules in 1 ms. Remains 13 /25 variables (removed 12) and now considering 24/95 (removed 71) transitions.
// Phase 1: matrix 24 rows 13 cols
[2024-06-01 08:21:38] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:21:38] [INFO ] Invariant cache hit.
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 13/83 places, 24/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 13/83 places, 24/545 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-14 finished in 514 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||G(p1)||X(p2))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 54 transition count 373
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 54 transition count 373
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 81 place count 54 transition count 350
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 99 place count 36 transition count 98
Iterating global reduction 1 with 18 rules applied. Total rules applied 117 place count 36 transition count 98
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 135 place count 36 transition count 80
Applied a total of 135 rules in 3 ms. Remains 36 /83 variables (removed 47) and now considering 80/545 (removed 465) transitions.
// Phase 1: matrix 80 rows 36 cols
[2024-06-01 08:21:38] [INFO ] Computed 14 invariants in 0 ms
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants in 39 ms returned [6, 9, 11, 13, 15, 17, 19, 21, 24, 26, 29, 32, 34]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 40 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/83 places, 80/545 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 10 transition count 67
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 10 transition count 67
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 77 place count 10 transition count 16
Applied a total of 77 rules in 1 ms. Remains 10 /23 variables (removed 13) and now considering 16/80 (removed 64) transitions.
// Phase 1: matrix 16 rows 10 cols
[2024-06-01 08:21:38] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 08:21:38] [INFO ] Invariant cache hit.
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/83 places, 16/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 10/83 places, 16/545 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 44 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100040-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100040-LTLFireability-15 finished in 390 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(F(((p0&&X(p1))||G(p1))))))'
Found a Shortening insensitive property : ServersAndClients-PT-100040-LTLFireability-09
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 83/83 places, 545/545 transitions.
Graph (trivial) has 92 edges and 83 vertex of which 48 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 36 transition count 25
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 74 place count 3 transition count 5
Applied a total of 74 rules in 2 ms. Remains 3 /83 variables (removed 80) and now considering 5/545 (removed 540) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 08:21:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:21:39] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:21:39] [INFO ] Invariant cache hit.
[2024-06-01 08:21:39] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 08:21:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Starting structural reductions in LI_LTL mode, iteration 1 : 3/83 places, 5/545 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 85 ms. Remains : 3/83 places, 5/545 transitions.
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-09
Product exploration explored 100000 steps with 22672 reset in 54 ms.
Product exploration explored 100000 steps with 22685 reset in 50 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 (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-06-01 08:21:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/8 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 08:21:40] [INFO ] Invariant cache hit.
[2024-06-01 08:21:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:21:40] [INFO ] Invariant cache hit.
[2024-06-01 08:21:40] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 08:21:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 48ms
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 3/3 places, 5/5 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 : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22696 reset in 47 ms.
Product exploration explored 100000 steps with 22668 reset in 61 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 08:21:42] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 3/3 places, 5/5 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 08:21:42] [INFO ] Invariant cache hit.
[2024-06-01 08:21:42] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:21:42] [INFO ] Invariant cache hit.
[2024-06-01 08:21:42] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 08:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 55ms
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 3/3 places, 5/5 transitions.
Treatment of property ServersAndClients-PT-100040-LTLFireability-09 finished in 3362 ms.
[2024-06-01 08:21:42] [INFO ] Flatten gal took : 25 ms
[2024-06-01 08:21:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 08:21:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 545 transitions and 1539 arcs took 6 ms.
Total runtime 22942 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ServersAndClients-PT-100040-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717230102576

--------------------
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-100040-LTLFireability-09
ltl formula formula --ltl=/tmp/1485/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 83 places, 545 transitions and 1539 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 0.100 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1485/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1485/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1485/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1485/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 84 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 84, there are 560 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( 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: 72
pnml2lts-mc( 0/ 4): unique states count: 72
pnml2lts-mc( 0/ 4): unique transitions count: 545
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 537
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 759 transitions, fanout: 8.250
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 36.2 B/state, compr.: 10.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 557 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.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-100040"
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-100040, 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-171679080700620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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