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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 13 15:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 9.8M 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-100160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717230230157

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-100160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:23:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:23:52] [INFO ] Load time of PNML (sax parser for PT used): 705 ms
[2024-06-01 08:23:52] [INFO ] Transformed 16561 places.
[2024-06-01 08:23:52] [INFO ] Transformed 32200 transitions.
[2024-06-01 08:23:52] [INFO ] Found NUPN structural information;
[2024-06-01 08:23:52] [INFO ] Parsed PT model containing 16561 places and 32200 transitions and 96800 arcs in 926 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100160-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 248 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2024-06-01 08:23:53] [INFO ] Computed 361 invariants in 453 ms
[2024-06-01 08:24:28] [INFO ] Performed 2926/16561 implicitness test of which 223 returned IMPLICIT in 30 seconds.
[2024-06-01 08:24:58] [INFO ] Performed 14743/16561 implicitness test of which 329 returned IMPLICIT in 60 seconds.
[2024-06-01 08:25:03] [INFO ] Implicit Places using invariants in 70756 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, 401, 502, 603, 704, 805, 906, 1007, 1108, 1209, 1310, 1512, 1613, 1815, 1916, 2017, 2118, 2219, 2320, 2522, 2623, 2724, 2825, 2926, 3128, 3229, 3330, 3431, 3532, 3633, 3734, 3835, 3936, 4037, 4138, 4239, 4340, 4441, 4542, 4643, 4744, 4845, 4946, 5047, 5148, 5350, 5451, 5552, 5653, 5754, 5855, 6057, 6158, 6259, 6360, 6461, 6562, 6764, 6966, 7067, 7168, 7269, 7370, 7471, 7572, 7673, 7774, 7875, 8077, 8178, 8279, 8380, 8481, 8582, 8683, 8784, 8885, 8986, 9087, 9188, 9289, 9390, 9491, 9592, 9693, 9794, 9895, 9996, 10097, 10198, 10299, 10400, 10501, 10602, 10804, 10905, 11006, 11107, 11208, 11309, 11410, 11511, 11713, 11814, 11915, 12016, 12117, 12218, 12319, 12420, 12521, 12723, 12824, 12925, 13026, 13127, 13228, 13430, 13531, 13632, 13733, 13935, 14036, 14137, 14238, 14339, 14440, 14541, 14642, 14743, 14844, 14945, 15046, 15147, 15248, 15349, 15450, 15551, 15652, 15753, 15854, 15955, 16056, 16157, 16258, 16359, 16460]
Discarding 346 places :
Implicit Place search using SMT only with invariants took 70840 ms to find 346 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16215/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 110 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71219 ms. Remains : 16215/16561 places, 32200/32200 transitions.
Support contains 43 out of 16215 places after structural reductions.
[2024-06-01 08:25:05] [INFO ] Flatten gal took : 968 ms
[2024-06-01 08:25:05] [INFO ] Flatten gal took : 634 ms
[2024-06-01 08:25:07] [INFO ] Input system was already deterministic with 32200 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 5072 ms. (7 steps per ms) remains 8/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/3 properties
// Phase 1: matrix 32200 rows 16215 cols
[2024-06-01 08:25:16] [INFO ] Computed 15 invariants in 7792 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 2 (OVERLAPS) 16198/16202 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16202 variables, 16198/16204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16202 variables, 0/16204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/16215 variables, 13/16217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16215 variables, 13/16230 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16215 variables, 0/16230 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 12986ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 16215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29398 edges and 16215 vertex of which 14800 / 16215 are part of one of the 1 SCC in 42 ms
Free SCC test removed 14799 places
Drop transitions (Empty/Sink Transition effects.) removed 29398 transitions
Reduce isomorphic transitions removed 29398 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2201 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1402 place count 1415 transition count 1401
Reduce places removed 1413 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1399 transitions
Reduce isomorphic transitions removed 1399 transitions.
Iterating post reduction 1 with 2812 rules applied. Total rules applied 4214 place count 2 transition count 2
Applied a total of 4214 rules in 176 ms. Remains 2 /16215 variables (removed 16213) and now considering 2/32200 (removed 32198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 2/16215 places, 2/32200 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA ServersAndClients-PT-100160-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ServersAndClients-PT-100160-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 16215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29106 edges and 16215 vertex of which 14505 / 16215 are part of one of the 1 SCC in 14 ms
Free SCC test removed 14504 places
Ensure Unique test removed 28811 transitions
Reduce isomorphic transitions removed 28811 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1176 transitions
Trivial Post-agglo rules discarded 1176 transitions
Performed 1176 trivial Post agglomeration. Transition count delta: 1176
Iterating post reduction 0 with 1176 rules applied. Total rules applied 1177 place count 1711 transition count 2213
Reduce places removed 1176 places and 0 transitions.
Ensure Unique test removed 1164 transitions
Reduce isomorphic transitions removed 1164 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 2656 rules applied. Total rules applied 3833 place count 535 transition count 733
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 transitions.
Iterating post reduction 2 with 654 rules applied. Total rules applied 4487 place count 207 transition count 407
Discarding 195 places :
Symmetric choice reduction at 3 with 195 rule applications. Total rules 4682 place count 12 transition count 212
Iterating global reduction 3 with 195 rules applied. Total rules applied 4877 place count 12 transition count 212
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 3 with 194 rules applied. Total rules applied 5071 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 5073 place count 10 transition count 16
Iterating global reduction 4 with 2 rules applied. Total rules applied 5075 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5077 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 5079 place count 7 transition count 13
Iterating global reduction 4 with 2 rules applied. Total rules applied 5081 place count 7 transition count 13
Applied a total of 5081 rules in 176 ms. Remains 7 /16215 variables (removed 16208) and now considering 13/32200 (removed 32187) transitions.
// Phase 1: matrix 13 rows 7 cols
[2024-06-01 08:25:22] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:25:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 08:25:22] [INFO ] Invariant cache hit.
[2024-06-01 08:25:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 08:25:22] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 08:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/19 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/19 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/16215 places, 13/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 7/16215 places, 13/32200 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-01 finished in 973 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&&G(p1))))'
Support contains 2 out of 16215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29396 edges and 16215 vertex of which 14799 / 16215 are part of one of the 1 SCC in 13 ms
Free SCC test removed 14798 places
Ensure Unique test removed 29395 transitions
Reduce isomorphic transitions removed 29395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1401 place count 1417 transition count 1405
Reduce places removed 1414 places and 0 transitions.
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1400 transitions.
Iterating post reduction 1 with 2814 rules applied. Total rules applied 4215 place count 3 transition count 5
Applied a total of 4215 rules in 103 ms. Remains 3 /16215 variables (removed 16212) and now considering 5/32200 (removed 32195) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 08:25:23] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:25:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 08:25:23] [INFO ] Invariant cache hit.
[2024-06-01 08:25:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 08:25:23] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:25:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Domain max(s): 3/3 constraints, 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 122 ms.
Refiners :[Domain max(s): 3/3 constraints, 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 162ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/16215 places, 5/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 3/16215 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-02 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 16215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29251 edges and 16215 vertex of which 14652 / 16215 are part of one of the 1 SCC in 13 ms
Free SCC test removed 14651 places
Ensure Unique test removed 29103 transitions
Reduce isomorphic transitions removed 29103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1287 transitions
Trivial Post-agglo rules discarded 1287 transitions
Performed 1287 trivial Post agglomeration. Transition count delta: 1287
Iterating post reduction 0 with 1287 rules applied. Total rules applied 1288 place count 1564 transition count 1810
Reduce places removed 1287 places and 0 transitions.
Ensure Unique test removed 1274 transitions
Reduce isomorphic transitions removed 1274 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 2720 rules applied. Total rules applied 4008 place count 277 transition count 377
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 2 with 343 rules applied. Total rules applied 4351 place count 105 transition count 206
Discarding 98 places :
Symmetric choice reduction at 3 with 98 rule applications. Total rules 4449 place count 7 transition count 108
Iterating global reduction 3 with 98 rules applied. Total rules applied 4547 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 4645 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4647 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 4648 place count 5 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 4649 place count 5 transition count 8
Applied a total of 4649 rules in 221 ms. Remains 5 /16215 variables (removed 16210) and now considering 8/32200 (removed 32192) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:25:24] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:25:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 08:25:24] [INFO ] Invariant cache hit.
[2024-06-01 08:25:24] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 08:25:24] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:25:24] [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 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
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 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/16215 places, 8/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 5/16215 places, 8/32200 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-03 finished in 492 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(G(p1))) U (p2&&F(p3)))))'
Support contains 4 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 66 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16215 cols
[2024-06-01 08:25:31] [INFO ] Computed 15 invariants in 7140 ms
[2024-06-01 08:25:40] [INFO ] Implicit Places using invariants in 15942 ms returned [1201, 1502, 2203, 2804, 5005, 5706, 6407, 6608, 7709, 10410, 11311, 12312, 13013, 13514]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 15960 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16201/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 89 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16116 ms. Remains : 16201/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-05 finished in 16446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 72 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:25:40] [INFO ] Invariant cache hit.
[2024-06-01 08:25:49] [INFO ] Implicit Places using invariants in 8411 ms returned [1201, 1502, 2203, 2804, 5005, 5706, 6407, 6608, 7709, 10410, 11311, 13013, 13514]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 8423 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16202/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 69 ms. Remains 16202 /16202 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8565 ms. Remains : 16202/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-08 finished in 8694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 2 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 69 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:25:49] [INFO ] Invariant cache hit.
[2024-06-01 08:25:58] [INFO ] Implicit Places using invariants in 8457 ms returned [1201, 1502, 2203, 5005, 5706, 6407, 6608, 7709, 10410, 11311, 12312, 13013, 13514]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 8473 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16202/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 108 ms. Remains 16202 /16202 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8652 ms. Remains : 16202/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-10
Product exploration explored 100000 steps with 144 reset in 2822 ms.
Product exploration explored 100000 steps with 121 reset in 2232 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1364 steps (0 resets) in 91 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 16202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16202/16202 places, 32200/32200 transitions.
Graph (trivial) has 31840 edges and 16202 vertex of which 15940 / 16202 are part of one of the 1 SCC in 7 ms
Free SCC test removed 15939 places
Ensure Unique test removed 31679 transitions
Reduce isomorphic transitions removed 31679 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 263 transition count 362
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 1 with 317 rules applied. Total rules applied 477 place count 104 transition count 204
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 575 place count 6 transition count 106
Iterating global reduction 2 with 98 rules applied. Total rules applied 673 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 771 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 774 place count 4 transition count 6
Iterating global reduction 3 with 1 rules applied. Total rules applied 775 place count 4 transition count 6
Applied a total of 775 rules in 51 ms. Remains 4 /16202 variables (removed 16198) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-06-01 08:26:04] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:26:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:26:04] [INFO ] Invariant cache hit.
[2024-06-01 08:26:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 08:26:04] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:26:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16202 places, 6/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 4/16202 places, 6/32200 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8618 reset in 176 ms.
Product exploration explored 100000 steps with 8778 reset in 91 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 08:26:05] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 4/4 places, 6/6 transitions.
Treatment of property ServersAndClients-PT-100160-LTLFireability-10 finished in 17035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1 U p2)))))'
Support contains 3 out of 16215 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 71 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16215 cols
[2024-06-01 08:26:13] [INFO ] Computed 15 invariants in 7203 ms
[2024-06-01 08:26:22] [INFO ] Implicit Places using invariants in 15611 ms returned [1201, 1502, 2203, 2804, 5005, 5706, 6407, 6608, 7709, 10410, 11311, 12312, 13013]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 15628 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16202/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 73 ms. Remains 16202 /16202 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15773 ms. Remains : 16202/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-11
Product exploration explored 100000 steps with 244 reset in 2187 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-11 finished in 18112 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' '!(((p0 U p1) U X(p2)))'
Support contains 6 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 67 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:26:24] [INFO ] Invariant cache hit.
[2024-06-01 08:26:32] [INFO ] Implicit Places using invariants in 7664 ms returned [1201, 2203, 2804, 5005, 5706, 6608, 7709, 10410, 12312, 13013, 13514]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 7679 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16204/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 71 ms. Remains 16204 /16204 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7818 ms. Remains : 16204/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-12 finished in 8102 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)||X(X(F(p1)))))'
Support contains 3 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 69 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:26:32] [INFO ] Invariant cache hit.
[2024-06-01 08:26:41] [INFO ] Implicit Places using invariants in 8653 ms returned [1201, 1502, 2203, 2804, 5005, 6407, 6608, 7709, 10410, 11311, 12312, 13013, 13514]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 8670 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16202/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 74 ms. Remains 16202 /16202 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8815 ms. Remains : 16202/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 4720 ms.
Product exploration explored 100000 steps with 33333 reset in 4666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100160-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100160-LTLFireability-13 finished in 18445 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(G(p1)))))'
Support contains 3 out of 16215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29251 edges and 16215 vertex of which 14652 / 16215 are part of one of the 1 SCC in 7 ms
Free SCC test removed 14651 places
Ensure Unique test removed 29103 transitions
Reduce isomorphic transitions removed 29103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1287 transitions
Trivial Post-agglo rules discarded 1287 transitions
Performed 1287 trivial Post agglomeration. Transition count delta: 1287
Iterating post reduction 0 with 1287 rules applied. Total rules applied 1288 place count 1564 transition count 1810
Reduce places removed 1287 places and 0 transitions.
Ensure Unique test removed 1274 transitions
Reduce isomorphic transitions removed 1274 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 2720 rules applied. Total rules applied 4008 place count 277 transition count 377
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 2 with 343 rules applied. Total rules applied 4351 place count 105 transition count 206
Discarding 98 places :
Symmetric choice reduction at 3 with 98 rule applications. Total rules 4449 place count 7 transition count 108
Iterating global reduction 3 with 98 rules applied. Total rules applied 4547 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 4645 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4647 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 4648 place count 5 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 4649 place count 5 transition count 8
Applied a total of 4649 rules in 86 ms. Remains 5 /16215 variables (removed 16210) and now considering 8/32200 (removed 32192) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:26:51] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:26:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:26:51] [INFO ] Invariant cache hit.
[2024-06-01 08:26:51] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-06-01 08:26:51] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:26:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/16215 places, 8/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 5/16215 places, 8/32200 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-14 finished in 329 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((G(p1)||p0))))'
Support contains 4 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 67 ms. Remains 16215 /16215 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16215 cols
[2024-06-01 08:26:58] [INFO ] Computed 15 invariants in 6987 ms
[2024-06-01 08:27:07] [INFO ] Implicit Places using invariants in 15631 ms returned [1201, 1502, 2203, 2804, 5706, 6407, 6608, 7709, 10410, 11311, 12312, 13514]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 15654 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16203/16215 places, 32200/32200 transitions.
Applied a total of 0 rules in 75 ms. Remains 16203 /16203 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15798 ms. Remains : 16203/16215 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-15
Product exploration explored 100000 steps with 49746 reset in 5277 ms.
Product exploration explored 100000 steps with 49762 reset in 5441 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 p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100160-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100160-LTLFireability-15 finished in 26733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Found a Lengthening insensitive property : ServersAndClients-PT-100160-LTLFireability-10
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 16215 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16215/16215 places, 32200/32200 transitions.
Graph (trivial) has 29253 edges and 16215 vertex of which 14653 / 16215 are part of one of the 1 SCC in 9 ms
Free SCC test removed 14652 places
Ensure Unique test removed 29105 transitions
Reduce isomorphic transitions removed 29105 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1287 transitions
Trivial Post-agglo rules discarded 1287 transitions
Performed 1287 trivial Post agglomeration. Transition count delta: 1287
Iterating post reduction 0 with 1287 rules applied. Total rules applied 1288 place count 1563 transition count 1808
Reduce places removed 1287 places and 0 transitions.
Ensure Unique test removed 1274 transitions
Reduce isomorphic transitions removed 1274 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 2720 rules applied. Total rules applied 4008 place count 276 transition count 375
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 2 with 343 rules applied. Total rules applied 4351 place count 104 transition count 204
Discarding 98 places :
Symmetric choice reduction at 3 with 98 rule applications. Total rules 4449 place count 6 transition count 106
Iterating global reduction 3 with 98 rules applied. Total rules applied 4547 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 4645 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4647 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 4648 place count 4 transition count 6
Iterating global reduction 4 with 1 rules applied. Total rules applied 4649 place count 4 transition count 6
Applied a total of 4649 rules in 101 ms. Remains 4 /16215 variables (removed 16211) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-06-01 08:27:18] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:27:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:27:18] [INFO ] Invariant cache hit.
[2024-06-01 08:27:18] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 08:27:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/16215 places, 6/32200 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 198 ms. Remains : 4/16215 places, 6/32200 transitions.
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-10
Product exploration explored 100000 steps with 7558 reset in 55 ms.
Product exploration explored 100000 steps with 7417 reset in 60 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2024-06-01 08:27:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 4/10 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 344 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 08:27:20] [INFO ] Invariant cache hit.
[2024-06-01 08:27:20] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:27:20] [INFO ] Invariant cache hit.
[2024-06-01 08:27:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 08:27:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 4/4 places, 6/6 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 (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 261 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7458 reset in 57 ms.
Product exploration explored 100000 steps with 7453 reset in 59 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 08:27:21] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 4/4 places, 6/6 transitions.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 08:27:21] [INFO ] Invariant cache hit.
[2024-06-01 08:27:21] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:27:21] [INFO ] Invariant cache hit.
[2024-06-01 08:27:21] [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 3 sub problems to find dead transitions.
[2024-06-01 08:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 4/4 places, 6/6 transitions.
Treatment of property ServersAndClients-PT-100160-LTLFireability-10 finished in 4243 ms.
[2024-06-01 08:27:23] [INFO ] Flatten gal took : 529 ms
[2024-06-01 08:27:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 08:27:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16215 places, 32200 transitions and 67200 arcs took 91 ms.
Total runtime 212006 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ServersAndClients-PT-100160-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717230828104

--------------------
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-100160-LTLFireability-10
ltl formula formula --ltl=/tmp/1241/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 16215 places, 32200 transitions and 67200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.350 real 0.990 user 1.460 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16217 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16216, there are 32231 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): ~8 levels ~10000 states ~20972 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 422
pnml2lts-mc( 0/ 4): unique states count: 16622
pnml2lts-mc( 0/ 4): unique transitions count: 48621
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16528
pnml2lts-mc( 0/ 4): - claim found count: 16852
pnml2lts-mc( 0/ 4): - claim success count: 16684
pnml2lts-mc( 0/ 4): - cum. max stack depth: 33
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16694 states 51835 transitions, fanout: 3.105
pnml2lts-mc( 0/ 4): Total exploration time 336.830 sec (336.760 sec minimum, 336.780 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50, Transitions per second: 154
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 42.4 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33184 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.7MB (~258.0MB paged-in)

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

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