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.r092-tall-171624189600588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DBSingleClientW-PT-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 DBSingleClientW-PT-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716331650141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:47:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:47:31] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-05-21 22:47:31] [INFO ] Transformed 4763 places.
[2024-05-21 22:47:31] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:47:31] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 376 places :
Symmetric choice reduction at 1 with 376 rule applications. Total rules 621 place count 761 transition count 1349
Iterating global reduction 1 with 376 rules applied. Total rules applied 997 place count 761 transition count 1349
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1033 place count 761 transition count 1313
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1332 place count 462 transition count 1014
Iterating global reduction 2 with 299 rules applied. Total rules applied 1631 place count 462 transition count 1014
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1637 place count 462 transition count 1008
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 1860 place count 239 transition count 696
Iterating global reduction 3 with 223 rules applied. Total rules applied 2083 place count 239 transition count 696
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Iterating post reduction 3 with 227 rules applied. Total rules applied 2310 place count 239 transition count 469
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2326 place count 223 transition count 438
Iterating global reduction 4 with 16 rules applied. Total rules applied 2342 place count 223 transition count 438
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2346 place count 223 transition count 434
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2357 place count 212 transition count 423
Iterating global reduction 5 with 11 rules applied. Total rules applied 2368 place count 212 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2370 place count 212 transition count 421
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2380 place count 202 transition count 411
Iterating global reduction 6 with 10 rules applied. Total rules applied 2390 place count 202 transition count 411
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2397 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2399 place count 200 transition count 400
Iterating global reduction 7 with 2 rules applied. Total rules applied 2401 place count 200 transition count 400
Applied a total of 2401 rules in 197 ms. Remains 200 /1183 variables (removed 983) and now considering 400/2478 (removed 2078) transitions.
// Phase 1: matrix 400 rows 200 cols
[2024-05-21 22:47:32] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 22:47:32] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-21 22:47:32] [INFO ] Invariant cache hit.
[2024-05-21 22:47:32] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 22:47:33] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-21 22:47:33] [INFO ] Invariant cache hit.
[2024-05-21 22:47:33] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/600 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 209/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 0/600 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 411 constraints, problems are : Problem set: 0 solved, 399 unsolved in 22004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/600 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 209/411 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 399/810 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 810 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
After SMT, in 53226ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 53241ms
Starting structural reductions in LTL mode, iteration 1 : 200/1183 places, 400/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54374 ms. Remains : 200/1183 places, 400/2478 transitions.
Support contains 29 out of 200 places after structural reductions.
[2024-05-21 22:48:26] [INFO ] Flatten gal took : 52 ms
[2024-05-21 22:48:26] [INFO ] Flatten gal took : 27 ms
[2024-05-21 22:48:26] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 28 out of 200 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (9288 resets) in 3285 ms. (12 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (182 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (348 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (382 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (388 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (357 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (188 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (205 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (178 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (172 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (183 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (177 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (386 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (170 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (396 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (160 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (186 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (365 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (175 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (185 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (183 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (192 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (197 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (167 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (365 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 27357 steps, run visited all 25 properties in 303 ms. (steps per millisecond=90 )
Probabilistic random walk after 27357 steps, saw 12213 distinct states, run finished after 307 ms. (steps per millisecond=89 ) properties seen :25
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 806 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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||X(X(p2))))))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 321
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 296
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 296
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 91 place count 162 transition count 282
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 150 transition count 257
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 150 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 150 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 149 place count 140 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 137 transition count 221
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 137 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 137 transition count 218
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 136 transition count 217
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 136 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 136 transition count 214
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 165 place count 134 transition count 202
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 134 transition count 202
Applied a total of 167 rules in 22 ms. Remains 134 /200 variables (removed 66) and now considering 202/400 (removed 198) transitions.
// Phase 1: matrix 202 rows 134 cols
[2024-05-21 22:48:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:48:28] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-21 22:48:28] [INFO ] Invariant cache hit.
[2024-05-21 22:48:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:48:29] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 22:48:29] [INFO ] Invariant cache hit.
[2024-05-21 22:48:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22278ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22287ms
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 202/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22976 ms. Remains : 134/200 places, 202/400 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-00
Product exploration explored 100000 steps with 22955 reset in 284 ms.
Product exploration explored 100000 steps with 22962 reset in 226 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9179 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3841 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3779 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1720 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3852 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 156 ms. (steps per millisecond=110 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 156 ms. (steps per millisecond=110 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:48:54] [INFO ] Invariant cache hit.
[2024-05-21 22:48:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:48:54] [INFO ] Invariant cache hit.
[2024-05-21 22:48:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:48:54] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 22:48:54] [INFO ] Invariant cache hit.
[2024-05-21 22:48:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5744 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22246ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22249ms
Finished structural reductions in LTL mode , in 1 iterations and 22686 ms. Remains : 134/134 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9174 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3783 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3761 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3900 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 110 ms. (steps per millisecond=157 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 110 ms. (steps per millisecond=157 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22975 reset in 165 ms.
Product exploration explored 100000 steps with 22889 reset in 152 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:49:19] [INFO ] Redundant transitions in 7 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 22:49:19] [INFO ] Invariant cache hit.
[2024-05-21 22:49:19] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 22356ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22387 ms. Remains : 134/134 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin10390232333392038275
[2024-05-21 22:49:42] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10390232333392038275
Running compilation step : cd /tmp/ltsmin10390232333392038275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 503 ms.
Running link step : cd /tmp/ltsmin10390232333392038275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10390232333392038275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased165790345394377920.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-21 22:49:57] [INFO ] Invariant cache hit.
[2024-05-21 22:49:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 22:49:57] [INFO ] Invariant cache hit.
[2024-05-21 22:49:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-21 22:49:57] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 22:49:57] [INFO ] Invariant cache hit.
[2024-05-21 22:49:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/336 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 75/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 21639ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 21643ms
Finished structural reductions in LTL mode , in 1 iterations and 22127 ms. Remains : 134/134 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin1159009562651132448
[2024-05-21 22:50:19] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1159009562651132448
Running compilation step : cd /tmp/ltsmin1159009562651132448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin1159009562651132448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1159009562651132448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16534162639127085477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:50:34] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:50:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:50:34] [INFO ] Time to serialize gal into /tmp/LTL5692203278634104460.gal : 4 ms
[2024-05-21 22:50:34] [INFO ] Time to serialize properties into /tmp/LTL7971660626399462982.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5692203278634104460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17544357096140762835.hoa' '-atoms' '/tmp/LTL7971660626399462982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7971660626399462982.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17544357096140762835.hoa
Detected timeout of ITS tools.
[2024-05-21 22:50:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:50:49] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:50:49] [INFO ] Time to serialize gal into /tmp/LTL6837496067897610194.gal : 2 ms
[2024-05-21 22:50:49] [INFO ] Time to serialize properties into /tmp/LTL4112288255169343102.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6837496067897610194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4112288255169343102.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))
Detected timeout of ITS tools.
[2024-05-21 22:51:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:51:04] [INFO ] Applying decomposition
[2024-05-21 22:51:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17786715703751729395.txt' '-o' '/tmp/graph17786715703751729395.bin' '-w' '/tmp/graph17786715703751729395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17786715703751729395.bin' '-l' '-1' '-v' '-w' '/tmp/graph17786715703751729395.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:51:04] [INFO ] Decomposing Gal with order
[2024-05-21 22:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:51:04] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-21 22:51:04] [INFO ] Flatten gal took : 56 ms
[2024-05-21 22:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 10 ms.
[2024-05-21 22:51:04] [INFO ] Time to serialize gal into /tmp/LTL6798652950823929597.gal : 4 ms
[2024-05-21 22:51:04] [INFO ] Time to serialize properties into /tmp/LTL14414804040668665172.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6798652950823929597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14414804040668665172.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u0.s1<1)||(i0.u0.l1713<1))"))&&(F(G(("(((i0.u0.p261<1)||(i4.u3.l0<1))&&((i0.u0.s1<1)||(u16.l4107<1)))")||(X(X("((i0.u0.p...186
Formula 0 simplified : F(G!"((i0.u0.s1<1)||(i0.u0.l1713<1))" | GF(!"(((i0.u0.p261<1)||(i4.u3.l0<1))&&((i0.u0.s1<1)||(u16.l4107<1)))" & XX!"((i0.u0.p261<1)|...172
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-00 finished in 171474 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(F((!p0||G(!p1)))) U p2))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 314
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 312
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 289
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 289
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 87 place count 163 transition count 278
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 152 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 152 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 152 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 123 place count 141 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 134 place count 141 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 141 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 137 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 137 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 137 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 136 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 136 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 136 transition count 215
Applied a total of 157 rules in 22 ms. Remains 136 /200 variables (removed 64) and now considering 215/400 (removed 185) transitions.
// Phase 1: matrix 215 rows 136 cols
[2024-05-21 22:51:20] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 22:51:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 22:51:20] [INFO ] Invariant cache hit.
[2024-05-21 22:51:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 22:51:20] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-21 22:51:20] [INFO ] Invariant cache hit.
[2024-05-21 22:51:20] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/351 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/351 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 228 constraints, problems are : Problem set: 0 solved, 214 unsolved in 6715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/351 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 90/228 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 214/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 442 constraints, problems are : Problem set: 0 solved, 214 unsolved in 19070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 26131ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 26134ms
Starting structural reductions in LTL mode, iteration 1 : 136/200 places, 215/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26531 ms. Remains : 136/200 places, 215/400 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-01 finished in 26794 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||F(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 328
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 179 transition count 325
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 160 transition count 300
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 160 transition count 300
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 98 place count 160 transition count 285
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 148 transition count 259
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 148 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 148 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 137 transition count 229
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 137 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 153 place count 137 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 157 place count 133 transition count 220
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 133 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 133 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 132 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 132 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 173 place count 129 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 176 place count 129 transition count 192
Applied a total of 176 rules in 20 ms. Remains 129 /200 variables (removed 71) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 129 cols
[2024-05-21 22:51:46] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:51:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 22:51:46] [INFO ] Invariant cache hit.
[2024-05-21 22:51:46] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:51:47] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-21 22:51:47] [INFO ] Invariant cache hit.
[2024-05-21 22:51:47] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/321 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 4873 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/321 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 17166ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 17169ms
Starting structural reductions in LTL mode, iteration 1 : 129/200 places, 192/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17521 ms. Remains : 129/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 17675 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((G(p1)||G(p2)||p0)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 320
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 318
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 295
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 281
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 153 transition count 261
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 153 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 153 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 144 transition count 241
Iterating global reduction 3 with 9 rules applied. Total rules applied 131 place count 144 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 144 transition count 236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 141 transition count 233
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 141 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 141 transition count 229
Applied a total of 146 rules in 12 ms. Remains 141 /200 variables (removed 59) and now considering 229/400 (removed 171) transitions.
// Phase 1: matrix 229 rows 141 cols
[2024-05-21 22:52:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:52:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:52:04] [INFO ] Invariant cache hit.
[2024-05-21 22:52:04] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-21 22:52:04] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 22:52:04] [INFO ] Invariant cache hit.
[2024-05-21 22:52:04] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 97/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 240 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 97/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 468 constraints, problems are : Problem set: 0 solved, 228 unsolved in 19642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 27346ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 27350ms
Starting structural reductions in LTL mode, iteration 1 : 141/200 places, 229/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27716 ms. Remains : 141/200 places, 229/400 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 353 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 528 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 28465 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 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 178 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 159 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 159 transition count 285
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 98 place count 159 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 146 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 146 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 146 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 140 place count 134 transition count 212
Iterating global reduction 3 with 12 rules applied. Total rules applied 152 place count 134 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 158 place count 134 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 130 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 130 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 129 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 175 place count 129 transition count 194
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 127 transition count 182
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 127 transition count 182
Applied a total of 179 rules in 39 ms. Remains 127 /200 variables (removed 73) and now considering 182/400 (removed 218) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 22:52:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:52:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:52:33] [INFO ] Invariant cache hit.
[2024-05-21 22:52:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:52:33] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 22:52:33] [INFO ] Redundant transitions in 7 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 22:52:33] [INFO ] Invariant cache hit.
[2024-05-21 22:52:33] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16137ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/200 places, 182/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16526 ms. Remains : 127/200 places, 182/400 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08
Product exploration explored 100000 steps with 23076 reset in 129 ms.
Product exploration explored 100000 steps with 22846 reset in 129 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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)]
RANDOM walk for 40000 steps (9146 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3832 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 35 ms. (steps per millisecond=593 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 35 ms. (steps per millisecond=593 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 22:52:50] [INFO ] Invariant cache hit.
[2024-05-21 22:52:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:52:50] [INFO ] Invariant cache hit.
[2024-05-21 22:52:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:52:50] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 22:52:50] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 22:52:50] [INFO ] Invariant cache hit.
[2024-05-21 22:52:50] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9814 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 15926ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 15928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16265 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9235 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3799 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 38 ms. (steps per millisecond=546 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 38 ms. (steps per millisecond=546 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22917 reset in 121 ms.
Product exploration explored 100000 steps with 22983 reset in 122 ms.
Built C files in :
/tmp/ltsmin15101294050556685666
[2024-05-21 22:53:07] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 22:53:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:07] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 22:53:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:07] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 22:53:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:07] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15101294050556685666
Running compilation step : cd /tmp/ltsmin15101294050556685666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 463 ms.
Running link step : cd /tmp/ltsmin15101294050556685666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15101294050556685666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6743417537132950334.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 22:53:22] [INFO ] Invariant cache hit.
[2024-05-21 22:53:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 22:53:22] [INFO ] Invariant cache hit.
[2024-05-21 22:53:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:53:22] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-21 22:53:22] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 22:53:22] [INFO ] Invariant cache hit.
[2024-05-21 22:53:22] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5858 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 16782ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17171 ms. Remains : 127/127 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin4683153422121513076
[2024-05-21 22:53:39] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 22:53:39] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:39] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 22:53:39] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:39] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 22:53:39] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:53:39] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4683153422121513076
Running compilation step : cd /tmp/ltsmin4683153422121513076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 465 ms.
Running link step : cd /tmp/ltsmin4683153422121513076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4683153422121513076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15995823303242598931.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:53:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:53:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:53:54] [INFO ] Time to serialize gal into /tmp/LTL1840399116659553265.gal : 2 ms
[2024-05-21 22:53:54] [INFO ] Time to serialize properties into /tmp/LTL9083615228199212885.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1840399116659553265.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14911707790358856092.hoa' '-atoms' '/tmp/LTL9083615228199212885.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9083615228199212885.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14911707790358856092.hoa
Detected timeout of ITS tools.
[2024-05-21 22:54:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:54:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:54:09] [INFO ] Time to serialize gal into /tmp/LTL12097163739718633476.gal : 2 ms
[2024-05-21 22:54:09] [INFO ] Time to serialize properties into /tmp/LTL8910794142667882073.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12097163739718633476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8910794142667882073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p228<1)||(l0<1))"))))
Formula 0 simplified : FG!"((p228<1)||(l0<1))"
Detected timeout of ITS tools.
[2024-05-21 22:54:25] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:54:25] [INFO ] Applying decomposition
[2024-05-21 22:54:25] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16474642266446946706.txt' '-o' '/tmp/graph16474642266446946706.bin' '-w' '/tmp/graph16474642266446946706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16474642266446946706.bin' '-l' '-1' '-v' '-w' '/tmp/graph16474642266446946706.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:54:25] [INFO ] Decomposing Gal with order
[2024-05-21 22:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:54:25] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-21 22:54:25] [INFO ] Flatten gal took : 21 ms
[2024-05-21 22:54:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 7 ms.
[2024-05-21 22:54:25] [INFO ] Time to serialize gal into /tmp/LTL3646152317475680289.gal : 3 ms
[2024-05-21 22:54:25] [INFO ] Time to serialize properties into /tmp/LTL6668957456892966442.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3646152317475680289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6668957456892966442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u11.p228<1)||(i4.u0.l0<1))"))))
Formula 0 simplified : FG!"((i2.u11.p228<1)||(i4.u0.l0<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 127234 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)||X(G(p1)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 178 transition count 321
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 178 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 178 transition count 318
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 158 transition count 292
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 158 transition count 292
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 158 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 146 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 146 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 146 transition count 252
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 143 place count 134 transition count 224
Iterating global reduction 3 with 12 rules applied. Total rules applied 155 place count 134 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 134 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 165 place count 130 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 169 place count 130 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 130 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 174 place count 129 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 129 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 129 transition count 206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 181 place count 126 transition count 186
Iterating global reduction 6 with 3 rules applied. Total rules applied 184 place count 126 transition count 186
Applied a total of 184 rules in 8 ms. Remains 126 /200 variables (removed 74) and now considering 186/400 (removed 214) transitions.
// Phase 1: matrix 186 rows 126 cols
[2024-05-21 22:54:40] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:54:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:54:40] [INFO ] Invariant cache hit.
[2024-05-21 22:54:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 22:54:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 22:54:40] [INFO ] Invariant cache hit.
[2024-05-21 22:54:40] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 17205ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 17208ms
Starting structural reductions in LTL mode, iteration 1 : 126/200 places, 186/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17512 ms. Remains : 126/200 places, 186/400 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09
Product exploration explored 100000 steps with 22956 reset in 144 ms.
Product exploration explored 100000 steps with 23006 reset in 146 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 460 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 214 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9186 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1857 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14627 steps, run visited all 1 properties in 27 ms. (steps per millisecond=541 )
Probabilistic random walk after 14627 steps, saw 7153 distinct states, run finished after 27 ms. (steps per millisecond=541 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 18460 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((p0||G(p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 311
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 291
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 277
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 247
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 220
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 134 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 134 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 161 place count 134 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 133 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 133 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 166 place count 133 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 130 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 130 transition count 183
Applied a total of 172 rules in 44 ms. Remains 130 /200 variables (removed 70) and now considering 183/400 (removed 217) transitions.
// Phase 1: matrix 183 rows 130 cols
[2024-05-21 22:54:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:54:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:54:58] [INFO ] Invariant cache hit.
[2024-05-21 22:54:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 22:54:58] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 22:54:58] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 22:54:58] [INFO ] Invariant cache hit.
[2024-05-21 22:54:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/313 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 186 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4717 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/313 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 182/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 368 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 18161ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 18163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/200 places, 183/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18511 ms. Remains : 130/200 places, 183/400 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10
Entered a terminal (fully accepting) state of product in 7112 steps with 1614 reset in 17 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 18654 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((p0 U ((p1 U p2) U p3))))||X((X(p1) U p0))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 328
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 180 transition count 326
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 163 transition count 304
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 163 transition count 304
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 90 place count 163 transition count 290
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 152 transition count 267
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 152 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 152 transition count 265
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 124 place count 142 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 134 place count 142 transition count 239
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 142 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 140 transition count 221
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 140 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 140 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 139 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 139 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 139 transition count 216
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 137 transition count 203
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 137 transition count 203
Applied a total of 164 rules in 18 ms. Remains 137 /200 variables (removed 63) and now considering 203/400 (removed 197) transitions.
// Phase 1: matrix 203 rows 137 cols
[2024-05-21 22:55:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:55:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:55:17] [INFO ] Invariant cache hit.
[2024-05-21 22:55:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 22:55:17] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-21 22:55:17] [INFO ] Invariant cache hit.
[2024-05-21 22:55:17] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/340 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 209 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5361 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/340 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 70/209 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 202/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 411 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 22477ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 22480ms
Starting structural reductions in LTL mode, iteration 1 : 137/200 places, 203/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22835 ms. Remains : 137/200 places, 203/400 transitions.
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 23312 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 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 325
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 299
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 299
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 92 place count 161 transition count 287
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 150 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 150 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 150 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 140 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 136 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 136 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 154 place count 136 transition count 223
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 135 transition count 222
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 135 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 135 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 162 place count 132 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 132 transition count 199
Applied a total of 165 rules in 25 ms. Remains 132 /200 variables (removed 68) and now considering 199/400 (removed 201) transitions.
// Phase 1: matrix 199 rows 132 cols
[2024-05-21 22:55:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:55:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 22:55:40] [INFO ] Invariant cache hit.
[2024-05-21 22:55:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 22:55:40] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 22:55:40] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 22:55:40] [INFO ] Invariant cache hit.
[2024-05-21 22:55:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20209ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20212ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 199/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20600 ms. Remains : 132/200 places, 199/400 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13
Product exploration explored 100000 steps with 23011 reset in 155 ms.
Product exploration explored 100000 steps with 22929 reset in 152 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9204 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1769 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1762 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1810 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 166 ms. (steps per millisecond=127 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 166 ms. (steps per millisecond=127 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 199/199 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 22:56:02] [INFO ] Invariant cache hit.
[2024-05-21 22:56:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:56:02] [INFO ] Invariant cache hit.
[2024-05-21 22:56:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 22:56:02] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-21 22:56:02] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 22:56:02] [INFO ] Invariant cache hit.
[2024-05-21 22:56:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/331 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 72/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 20137ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20516 ms. Remains : 132/132 places, 199/199 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 486 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9300 resets) in 534 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1785 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1789 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21179 steps, run visited all 4 properties in 219 ms. (steps per millisecond=96 )
Probabilistic random walk after 21179 steps, saw 10442 distinct states, run finished after 220 ms. (steps per millisecond=96 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22856 reset in 166 ms.
Product exploration explored 100000 steps with 23012 reset in 172 ms.
Built C files in :
/tmp/ltsmin7591179919800505076
[2024-05-21 22:56:24] [INFO ] Computing symmetric may disable matrix : 199 transitions.
[2024-05-21 22:56:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:56:24] [INFO ] Computing symmetric may enable matrix : 199 transitions.
[2024-05-21 22:56:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:56:24] [INFO ] Computing Do-Not-Accords matrix : 199 transitions.
[2024-05-21 22:56:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:56:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7591179919800505076
Running compilation step : cd /tmp/ltsmin7591179919800505076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 501 ms.
Running link step : cd /tmp/ltsmin7591179919800505076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7591179919800505076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1606997265731835623.hoa' '--buchi-type=spotba'
LTSmin run took 753 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 45287 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(p0)||X(((p2 U p0)&&p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 180 transition count 326
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 180 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 180 transition count 325
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 162 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 162 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 90 place count 162 transition count 288
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 151 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 151 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 151 transition count 259
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 142 transition count 243
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 142 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 142 transition count 239
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 138 transition count 235
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 138 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 150 place count 138 transition count 231
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 137 transition count 230
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 137 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 155 place count 137 transition count 227
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 158 place count 134 transition count 207
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 134 transition count 207
Applied a total of 161 rules in 16 ms. Remains 134 /200 variables (removed 66) and now considering 207/400 (removed 193) transitions.
// Phase 1: matrix 207 rows 134 cols
[2024-05-21 22:56:25] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 22:56:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:56:25] [INFO ] Invariant cache hit.
[2024-05-21 22:56:26] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:56:26] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-21 22:56:26] [INFO ] Invariant cache hit.
[2024-05-21 22:56:26] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/341 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 217 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/341 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 206/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 423 constraints, problems are : Problem set: 0 solved, 206 unsolved in 16300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 22511ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 22514ms
Starting structural reductions in LTL mode, iteration 1 : 134/200 places, 207/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22871 ms. Remains : 134/200 places, 207/400 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 23117 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)||X(F(p1)))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 400/400 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 179 transition count 320
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 179 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 318
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 161 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 161 transition count 295
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 94 place count 161 transition count 281
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 149 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 149 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 149 transition count 252
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 138 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 138 transition count 225
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 155 place count 138 transition count 214
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 135 transition count 211
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 134 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 171 place count 132 transition count 192
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 132 transition count 192
Applied a total of 173 rules in 27 ms. Remains 132 /200 variables (removed 68) and now considering 192/400 (removed 208) transitions.
// Phase 1: matrix 192 rows 132 cols
[2024-05-21 22:56:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:56:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 22:56:49] [INFO ] Invariant cache hit.
[2024-05-21 22:56:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 22:56:49] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 22:56:49] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-21 22:56:49] [INFO ] Invariant cache hit.
[2024-05-21 22:56:49] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 199 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 191/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 390 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 19272ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 19275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/200 places, 192/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19665 ms. Remains : 132/200 places, 192/400 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 19755 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||X(X(p2))))))))'
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)))'
[2024-05-21 22:57:09] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4060640922329441001
[2024-05-21 22:57:09] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2024-05-21 22:57:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:57:09] [INFO ] Applying decomposition
[2024-05-21 22:57:09] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2024-05-21 22:57:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:57:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9891483917963132351.txt' '-o' '/tmp/graph9891483917963132351.bin' '-w' '/tmp/graph9891483917963132351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9891483917963132351.bin' '-l' '-1' '-v' '-w' '/tmp/graph9891483917963132351.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:57:09] [INFO ] Decomposing Gal with order
[2024-05-21 22:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:57:09] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2024-05-21 22:57:09] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:57:09] [INFO ] Removed a total of 398 redundant transitions.
[2024-05-21 22:57:09] [INFO ] Flatten gal took : 43 ms
[2024-05-21 22:57:09] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4060640922329441001
Running compilation step : cd /tmp/ltsmin4060640922329441001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 22:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 386 labels/synchronizations in 15 ms.
[2024-05-21 22:57:09] [INFO ] Time to serialize gal into /tmp/LTLFireability370209433838317915.gal : 4 ms
[2024-05-21 22:57:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8208533551974448270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability370209433838317915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8208533551974448270.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((G((F("((i5.u0.s1<1)||(i5.u0.l1713<1))"))&&(F(G(("(((i5.u0.p261<1)||(i5.u0.l0<1))&&((i5.u0.s1<1)||(i8.i0.u30.l4107<1)))")||(X(X("((i...192
Formula 0 simplified : F(G!"((i5.u0.s1<1)||(i5.u0.l1713<1))" | GF(!"(((i5.u0.p261<1)||(i5.u0.l0<1))&&((i5.u0.s1<1)||(i8.i0.u30.l4107<1)))" & XX!"((i5.u0.p2...178
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin4060640922329441001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4060640922329441001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: LTL layer: formula: []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.024: "[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.039: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.116: There are 405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.116: State length is 201, there are 412 groups
pins2lts-mc-linux64( 0/ 8), 0.116: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.116: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.117: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.117: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.154: [Blue] ~40 levels ~960 states ~2696 transitions
pins2lts-mc-linux64( 0/ 8), 0.162: [Blue] ~75 levels ~1920 states ~5280 transitions
pins2lts-mc-linux64( 2/ 8), 0.197: [Blue] ~40 levels ~3840 states ~9016 transitions
pins2lts-mc-linux64( 0/ 8), 0.252: [Blue] ~124 levels ~7680 states ~17320 transitions
pins2lts-mc-linux64( 0/ 8), 0.352: [Blue] ~162 levels ~15360 states ~32912 transitions
pins2lts-mc-linux64( 0/ 8), 0.560: [Blue] ~162 levels ~30720 states ~64656 transitions
pins2lts-mc-linux64( 0/ 8), 1.015: [Blue] ~162 levels ~61440 states ~126736 transitions
pins2lts-mc-linux64( 0/ 8), 1.781: [Blue] ~162 levels ~122880 states ~253168 transitions
pins2lts-mc-linux64( 6/ 8), 4.684: [Blue] ~164 levels ~245760 states ~522968 transitions
pins2lts-mc-linux64( 6/ 8), 10.551: [Blue] ~216 levels ~491520 states ~1064192 transitions
pins2lts-mc-linux64( 1/ 8), 18.169: [Blue] ~106 levels ~983040 states ~2087440 transitions
pins2lts-mc-linux64( 4/ 8), 25.425: [Blue] ~139 levels ~1966080 states ~4209320 transitions
pins2lts-mc-linux64( 5/ 8), 39.891: [Blue] ~193 levels ~3932160 states ~8775392 transitions
pins2lts-mc-linux64( 5/ 8), 69.290: [Blue] ~15699 levels ~7864320 states ~18462320 transitions
pins2lts-mc-linux64( 5/ 8), 128.425: [Blue] ~127177 levels ~15728640 states ~40244744 transitions
pins2lts-mc-linux64( 5/ 8), 261.755: [Blue] ~475600 levels ~31457280 states ~86634632 transitions
pins2lts-mc-linux64( 5/ 8), 504.796: [Blue] ~1099339 levels ~62914560 states ~184122296 transitions
pins2lts-mc-linux64( 6/ 8), 545.079: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 545.292:
pins2lts-mc-linux64( 0/ 8), 545.292: Explored 66235971 states 213166209 transitions, fanout: 3.218
pins2lts-mc-linux64( 0/ 8), 545.292: Total exploration time 545.140 sec (544.990 sec minimum, 545.070 sec on average)
pins2lts-mc-linux64( 0/ 8), 545.292: States per second: 121503, Transitions per second: 391030
pins2lts-mc-linux64( 0/ 8), 545.292:
pins2lts-mc-linux64( 0/ 8), 545.292: State space has 69380438 states, 1817184 are accepting
pins2lts-mc-linux64( 0/ 8), 545.292: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 545.292: blue states: 66235971 (95.47%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 545.292: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 545.292: all-red states: 3976274 (5.73%), bogus 771 (0.00%)
pins2lts-mc-linux64( 0/ 8), 545.292:
pins2lts-mc-linux64( 0/ 8), 545.292: Total memory used for local state coloring: 58.0MB
pins2lts-mc-linux64( 0/ 8), 545.292:
pins2lts-mc-linux64( 0/ 8), 545.292: Queue width: 8B, total height: 3802444, memory: 29.01MB
pins2lts-mc-linux64( 0/ 8), 545.292: Tree memory: 785.3MB, 11.9 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 545.292: Tree fill ratio (roots/leafs): 51.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 545.292: Stored 402 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 545.292: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 545.292: Est. total memory use: 814.3MB (~1053.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4060640922329441001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4060640922329441001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-21 23:12:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:12:21] [INFO ] Time to serialize gal into /tmp/LTLFireability590812963960341305.gal : 5 ms
[2024-05-21 23:12:21] [INFO ] Time to serialize properties into /tmp/LTLFireability14984477360080278054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability590812963960341305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14984477360080278054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))
ITS-tools command line returned an error code 137
[2024-05-21 23:24:47] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:24:47] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-21 23:24:47] [INFO ] Transformed 200 places.
[2024-05-21 23:24:47] [INFO ] Transformed 400 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:24:47] [INFO ] Time to serialize gal into /tmp/LTLFireability3878777760714032099.gal : 2 ms
[2024-05-21 23:24:47] [INFO ] Time to serialize properties into /tmp/LTLFireability15701972630641353578.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3878777760714032099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15701972630641353578.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((s1<1)||(l1713<1))"))&&(F(G(("(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))")||(X(X("((p261<1)||(l0<1))")))))))))
Formula 0 simplified : F(G!"((s1<1)||(l1713<1))" | GF(!"(((p261<1)||(l0<1))&&((s1<1)||(l4107<1)))" & XX!"((p261<1)||(l0<1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m09, 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 r092-tall-171624189600588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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