Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993600204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DBSingleClientW-PT-d2m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779600415141

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-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:26:57] [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]
[2026-05-24 05:26:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:26:58] [INFO ] Load time of PNML (sax parser for PT used): 624 ms
[2026-05-24 05:26:58] [INFO ] Transformed 4763 places.
[2026-05-24 05:26:58] [INFO ] Transformed 2478 transitions.
[2026-05-24 05:26:58] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 881 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1390
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1390
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 1023 place count 760 transition count 1366
Discarding 302 places :
Symmetric choice reduction at 2 with 302 rule applications. Total rules 1325 place count 458 transition count 1064
Iterating global reduction 2 with 302 rules applied. Total rules applied 1627 place count 458 transition count 1064
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1635 place count 458 transition count 1056
Discarding 224 places :
Symmetric choice reduction at 3 with 224 rule applications. Total rules 1859 place count 234 transition count 749
Iterating global reduction 3 with 224 rules applied. Total rules applied 2083 place count 234 transition count 749
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 3 with 288 rules applied. Total rules applied 2371 place count 234 transition count 461
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2390 place count 215 transition count 424
Iterating global reduction 4 with 19 rules applied. Total rules applied 2409 place count 215 transition count 424
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2418 place count 215 transition count 415
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2429 place count 204 transition count 404
Iterating global reduction 5 with 11 rules applied. Total rules applied 2440 place count 204 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2441 place count 204 transition count 403
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2451 place count 194 transition count 393
Iterating global reduction 6 with 10 rules applied. Total rules applied 2461 place count 194 transition count 393
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2473 place count 194 transition count 381
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2475 place count 192 transition count 374
Iterating global reduction 7 with 2 rules applied. Total rules applied 2477 place count 192 transition count 374
Applied a total of 2477 rules in 285 ms. Remains 192 /1183 variables (removed 991) and now considering 374/2478 (removed 2104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3318814479253793399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10635136583350237841.kers'
[2026-05-24 05:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3318814479253793399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10635136583350237841.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 374 rows 192 cols 1098 entries
Finished phase 1 with 188 SingleSign rule and 2 generalized
[2026-05-24 05:26:59] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10635136583350237841.kers
Total runtime 7 ms.
[2026-05-24 05:27:00] [INFO ] Implicit Places using invariants in 807 ms returned []
[2026-05-24 05:27:00] [INFO ] Invariant cache hit.
[2026-05-24 05:27:00] [INFO ] State equation strengthened by 185 read => feed constraints.
[2026-05-24 05:27:02] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2026-05-24 05:27:02] [INFO ] Invariant cache hit.
[2026-05-24 05:27:02] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/566 variables, 192/194 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 185/379 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 379 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/566 variables, 192/194 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 185/379 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 373/752 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 752 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61315ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 61346ms
Starting structural reductions in LTL mode, iteration 1 : 192/1183 places, 374/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65095 ms. Remains : 192/1183 places, 374/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2026-05-24 05:28:04] [INFO ] Invariant cache hit.
[2026-05-24 05:28:04] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-24 05:28:04] [INFO ] Invariant cache hit.
[2026-05-24 05:28:04] [INFO ] State equation strengthened by 185 read => feed constraints.
[2026-05-24 05:28:05] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1908 ms. Remains : 192/192 places, 374/374 transitions.
Support contains 32 out of 192 places after structural reductions.
[2026-05-24 05:28:06] [INFO ] Flatten gal took : 120 ms
[2026-05-24 05:28:06] [INFO ] Flatten gal took : 61 ms
[2026-05-24 05:28:06] [INFO ] Input system was already deterministic with 374 transitions.
RANDOM walk for 40000 steps (9180 resets) in 3521 ms. (11 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4002 steps (166 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (176 resets) in 73 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (347 resets) in 92 ms. (43 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (391 resets) in 95 ms. (41 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (176 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (172 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (385 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (181 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (169 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (191 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (166 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (192 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (179 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (169 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (170 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (187 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (189 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (179 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (178 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (383 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (195 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (187 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (168 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
[2026-05-24 05:28:08] [INFO ] Invariant cache hit.
[2026-05-24 05:28:08] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 67/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 42/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 309/447 variables, 138/146 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 120/266 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 9 (OVERLAPS) 119/566 variables, 54/320 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 65/385 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 385 constraints, problems are : Problem set: 2 solved, 22 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 67/93 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 43/136 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 10/18 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 20/38 constraints. Problems are: Problem set: 2 solved, 22 unsolved
SMT process timed out in 10130ms, After SMT, problems are : Problem set: 2 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 356
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 187 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 184 transition count 351
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 184 transition count 351
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 181 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 181 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 181 transition count 345
Applied a total of 27 rules in 114 ms. Remains 181 /192 variables (removed 11) and now considering 345/374 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 181/192 places, 345/374 transitions.
RANDOM walk for 40000 steps (9234 resets) in 1035 ms. (38 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (183 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (378 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (369 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (183 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (176 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (419 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (190 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (182 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (198 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (176 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (177 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (183 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (187 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (170 resets) in 19 ms. (200 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (154 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (184 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (165 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (380 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (178 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (185 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (167 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
Finished probabilistic random walk after 230842 steps, run visited all 21 properties in 1195 ms. (steps per millisecond=193 )
Probabilistic random walk after 230842 steps, saw 92408 distinct states, run finished after 1202 ms. (steps per millisecond=192 ) properties seen :21
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 31 stable transitions
Graph (complete) has 762 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 170 transition count 292
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 170 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 170 transition count 285
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 156 transition count 270
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 156 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 156 transition count 263
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 97 place count 145 transition count 235
Iterating global reduction 2 with 11 rules applied. Total rules applied 108 place count 145 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 145 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 121 place count 137 transition count 206
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 137 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 135 place count 137 transition count 200
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 138 place count 134 transition count 197
Iterating global reduction 4 with 3 rules applied. Total rules applied 141 place count 134 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 134 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 133 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 133 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 132 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 132 transition count 191
Applied a total of 148 rules in 41 ms. Remains 132 /192 variables (removed 60) and now considering 191/374 (removed 183) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10691593840317693883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4498170178518018389.kers'
[2026-05-24 05:28:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10691593840317693883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4498170178518018389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 132 cols 621 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:28:20] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4498170178518018389.kers
Total runtime 3 ms.
[2026-05-24 05:28:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 05:28:20] [INFO ] Invariant cache hit.
[2026-05-24 05:28:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 05:28:21] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-24 05:28:21] [INFO ] Invariant cache hit.
[2026-05-24 05:28:21] [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, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/323 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 65/199 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/323 variables, and 203 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30021 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: 190/190 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/323 variables, 132/138 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 190/393 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 393 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30015 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: 190/190 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 132/192 places, 191/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61369 ms. Remains : 132/192 places, 191/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-00 finished in 61918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1||X(F(!p1))) U X(p2))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 297
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 297
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 171 transition count 291
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 157 transition count 276
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 157 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 157 transition count 270
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 146 transition count 241
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 146 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 146 transition count 235
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 138 transition count 212
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 138 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 138 transition count 210
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 132 place count 134 transition count 206
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 134 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 140 place count 134 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 133 transition count 201
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 133 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 132 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 132 transition count 199
Applied a total of 144 rules in 26 ms. Remains 132 /192 variables (removed 60) and now considering 199/374 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10887952300087121766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15190311401832561169.kers'
[2026-05-24 05:29:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10887952300087121766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15190311401832561169.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 132 cols 630 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:29:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15190311401832561169.kers
Total runtime 2 ms.
[2026-05-24 05:29:22] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-24 05:29:22] [INFO ] Invariant cache hit.
[2026-05-24 05:29:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-24 05:29:23] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 05:29:23] [INFO ] Invariant cache hit.
[2026-05-24 05:29:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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, 75/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 331/331 variables, and 217 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/331 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 75/217 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 198/415 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 415 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 132/192 places, 199/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61494 ms. Remains : 132/192 places, 199/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1||X(F(!p1))) U X(p2))))'
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND p1 (NOT p2)), (NOT p2), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-01 finished in 61863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)&&X(X(F(p1)))&&p0)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 170 transition count 292
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 170 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 170 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 156 transition count 272
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 156 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 156 transition count 267
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 144 transition count 232
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 144 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 113 place count 144 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 137 transition count 204
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 137 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 137 transition count 202
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 134 transition count 199
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 134 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 134 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 133 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 133 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 132 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 132 transition count 194
Applied a total of 141 rules in 23 ms. Remains 132 /192 variables (removed 60) and now considering 194/374 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6334274282970672372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7542115043049026837.kers'
[2026-05-24 05:30:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6334274282970672372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7542115043049026837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 132 cols 634 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:30:24] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7542115043049026837.kers
Total runtime 3 ms.
[2026-05-24 05:30:24] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 05:30:24] [INFO ] Invariant cache hit.
[2026-05-24 05:30:24] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 05:30:25] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 05:30:25] [INFO ] Invariant cache hit.
[2026-05-24 05:30:25] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/326 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 198 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15848 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/326 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 193/391 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 391 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45963ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 45964ms
Starting structural reductions in LTL mode, iteration 1 : 132/192 places, 194/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47123 ms. Remains : 132/192 places, 194/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)&&X(X(F(p1)))&&p0)))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-02 finished in 47313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 169 transition count 286
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 169 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 169 transition count 281
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 153 transition count 264
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 153 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 91 place count 153 transition count 256
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 140 transition count 219
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 140 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 140 transition count 213
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 131 place count 132 transition count 195
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 132 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 132 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 128 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 128 transition count 188
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 128 transition count 184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 127 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 127 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 126 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 126 transition count 181
Applied a total of 158 rules in 15 ms. Remains 126 /192 variables (removed 66) and now considering 181/374 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1525426562772565870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10700627150103119226.kers'
[2026-05-24 05:31:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1525426562772565870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10700627150103119226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 126 cols 591 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 05:31:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10700627150103119226.kers
Total runtime 1 ms.
[2026-05-24 05:31:11] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-24 05:31:11] [INFO ] Invariant cache hit.
[2026-05-24 05:31:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 05:31:12] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-24 05:31:12] [INFO ] Invariant cache hit.
[2026-05-24 05:31:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/307 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 190 constraints, problems are : Problem set: 0 solved, 180 unsolved in 25648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 181/307 variables, 126/130 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 60/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55761ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 55762ms
Starting structural reductions in LTL mode, iteration 1 : 126/192 places, 181/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56820 ms. Remains : 126/192 places, 181/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-04 finished in 56975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 169 transition count 285
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 169 transition count 285
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 169 transition count 280
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 153 transition count 263
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 153 transition count 263
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 91 place count 153 transition count 255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 141 transition count 225
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 141 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 141 transition count 219
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 130 place count 132 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 139 place count 132 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 132 transition count 191
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 128 transition count 187
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 128 transition count 187
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 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 127 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 126 transition count 180
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 126 transition count 180
Applied a total of 158 rules in 63 ms. Remains 126 /192 variables (removed 66) and now considering 180/374 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11790685164755387019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4091737195830625646.kers'
[2026-05-24 05:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11790685164755387019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4091737195830625646.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 126 cols 587 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 05:32:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4091737195830625646.kers
Total runtime 2 ms.
[2026-05-24 05:32:08] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 05:32:08] [INFO ] Invariant cache hit.
[2026-05-24 05:32:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 05:32:09] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2026-05-24 05:32:09] [INFO ] Redundant transitions in 11 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-24 05:32:09] [INFO ] Invariant cache hit.
[2026-05-24 05:32:09] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 188 constraints, problems are : Problem set: 0 solved, 179 unsolved in 17921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 367 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48013ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 48014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/192 places, 180/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49019 ms. Remains : 126/192 places, 180/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-06
Product exploration explored 100000 steps with 23012 reset in 661 ms.
Product exploration explored 100000 steps with 22901 reset in 447 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 456 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9217 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14517 steps, run visited all 1 properties in 49 ms. (steps per millisecond=296 )
Probabilistic random walk after 14517 steps, saw 7064 distinct states, run finished after 49 ms. (steps per millisecond=296 ) properties seen :1
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 31 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 367 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-06 finished in 50615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X(X(!p2)))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 304
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 171 transition count 298
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 155 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 155 transition count 281
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 89 place count 155 transition count 272
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 142 transition count 235
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 142 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 142 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 130 place count 133 transition count 204
Iterating global reduction 3 with 9 rules applied. Total rules applied 139 place count 133 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 133 transition count 201
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 129 transition count 197
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 129 transition count 197
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 129 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 128 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 128 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 127 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 127 transition count 190
Applied a total of 158 rules in 17 ms. Remains 127 /192 variables (removed 65) and now considering 190/374 (removed 184) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16433940458171916492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-764067271891615354.kers'
[2026-05-24 05:32:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16433940458171916492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-764067271891615354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 127 cols 603 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 05:32:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-764067271891615354.kers
Total runtime 2 ms.
[2026-05-24 05:32:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-24 05:32:59] [INFO ] Invariant cache hit.
[2026-05-24 05:32:59] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 05:32:59] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-24 05:32:59] [INFO ] Invariant cache hit.
[2026-05-24 05:32:59] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/317 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 71/200 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 206 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 190/317 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 189/395 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 395 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 127/192 places, 190/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60840 ms. Remains : 127/192 places, 190/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X(X(!p2)))))'
Stuttering acceptance computed with spot in 1303 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p1)), p2, p2, true, (AND (NOT p1) p2), (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-07
Product exploration explored 100000 steps with 28551 reset in 675 ms.
Product exploration explored 100000 steps with 28565 reset in 562 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 25 states, 59 edges and 3 AP (stutter sensitive) to 16 states, 33 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40000 steps (9173 resets) in 310 ms. (128 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1763 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1803 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1757 resets) in 268 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1787 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1815 resets) in 454 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1789 resets) in 336 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1790 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1742 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1827 resets) in 108 ms. (366 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 369380 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :7 out of 11
Probabilistic random walk after 369380 steps, saw 153210 distinct states, run finished after 3006 ms. (steps per millisecond=122 ) properties seen :7
[2026-05-24 05:34:06] [INFO ] Invariant cache hit.
[2026-05-24 05:34:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/55 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/86 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 146/232 variables, 86/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 27/115 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 311/317 variables, and 153 constraints, problems are : Problem set: 4 solved, 0 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/127 constraints, ReadFeed: 27/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge based reduction with 16 factoid took 167 ms. Reduced automaton from 16 states, 33 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p2, p2, p2, p2, true]
Knowledge-based reduction took 4601 ms.
Stuttering acceptance computed with spot in 146 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2026-05-24 05:34:07] [INFO ] Invariant cache hit.
[2026-05-24 05:34:07] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 05:34:07] [INFO ] Invariant cache hit.
[2026-05-24 05:34:07] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 05:34:08] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 911 ms. Remains : 127/127 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9162 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18557 steps, run visited all 1 properties in 91 ms. (steps per millisecond=203 )
Probabilistic random walk after 18557 steps, saw 9155 distinct states, run finished after 91 ms. (steps per millisecond=203 ) properties seen :1
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p2, p2, p2, p2, true]
Knowledge-based reduction took 547 ms.
Stuttering acceptance computed with spot in 217 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 211 ms :[p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 28552 reset in 524 ms.
Product exploration explored 100000 steps with 28548 reset in 490 ms.
Spot run failed in 149 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8877576213178142448
[2026-05-24 05:34:10] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8877576213178142448
Running compilation step : cd /tmp/ltsmin8877576213178142448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 706 ms.
Running link step : cd /tmp/ltsmin8877576213178142448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8877576213178142448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8948452255369070764.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-07 finished in 72173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!(X(F(X(p1)))&&G(p2)&&p0))) U p1))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 170 transition count 296
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 170 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 170 transition count 289
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 156 transition count 274
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 156 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 156 transition count 266
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 145 transition count 232
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 145 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 145 transition count 228
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 138 transition count 211
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 138 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 133 place count 138 transition count 205
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 135 transition count 202
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 135 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 135 transition count 200
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 134 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 134 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 133 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 133 transition count 197
Applied a total of 145 rules in 12 ms. Remains 133 /192 variables (removed 59) and now considering 197/374 (removed 177) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12238618926484956077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-106268246232406460.kers'
[2026-05-24 05:34:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12238618926484956077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-106268246232406460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 645 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-24 05:34:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-106268246232406460.kers
Total runtime 2 ms.
[2026-05-24 05:34:11] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-24 05:34:11] [INFO ] Invariant cache hit.
[2026-05-24 05:34:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 05:34:12] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-24 05:34:12] [INFO ] Invariant cache hit.
[2026-05-24 05:34:12] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/330 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 200 constraints, problems are : Problem set: 0 solved, 196 unsolved in 18978 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/330 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 196/396 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 396 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49125ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 49126ms
Starting structural reductions in LTL mode, iteration 1 : 133/192 places, 197/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50203 ms. Remains : 133/192 places, 197/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!(X(F(X(p1)))&&G(p2)&&p0))) U p1))'
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (OR (NOT p1) (AND p0 p2)), (AND p0 p2 p1), (AND p2 p1), (AND p2 p1), p2]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-08 finished in 50526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(X(G(p2))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 287
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 171 transition count 282
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 158 transition count 268
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 158 transition count 268
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 158 transition count 260
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 147 transition count 232
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 147 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 147 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 140 transition count 203
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 140 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 140 transition count 200
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 138 transition count 198
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 138 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 138 transition count 195
Applied a total of 133 rules in 11 ms. Remains 138 /192 variables (removed 54) and now considering 195/374 (removed 179) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6445538084110720930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6642286870583092674.kers'
[2026-05-24 05:35:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6445538084110720930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6642286870583092674.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 138 cols 651 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-24 05:35:01] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6642286870583092674.kers
Total runtime 2 ms.
[2026-05-24 05:35:02] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-24 05:35:02] [INFO ] Invariant cache hit.
[2026-05-24 05:35:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 05:35:03] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:35:03] [INFO ] Invariant cache hit.
[2026-05-24 05:35:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/333 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 58/198 constraints. Problems are: Problem set: 0 solved, 194 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 198 constraints, problems are : Problem set: 0 solved, 194 unsolved in 22177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/333 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 58/198 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 194/392 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 392 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52346ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 52347ms
Starting structural reductions in LTL mode, iteration 1 : 138/192 places, 195/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53817 ms. Remains : 138/192 places, 195/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(X(G(p2))))))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-10 finished in 54121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(!p0)))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 169 transition count 285
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 169 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 169 transition count 279
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 154 transition count 263
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 154 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 154 transition count 256
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 101 place count 142 transition count 227
Iterating global reduction 2 with 12 rules applied. Total rules applied 113 place count 142 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 142 transition count 221
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 128 place count 133 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 137 place count 133 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 140 place count 133 transition count 193
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 129 transition count 189
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 129 transition count 189
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 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 128 transition count 184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 127 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 127 transition count 182
Applied a total of 156 rules in 14 ms. Remains 127 /192 variables (removed 65) and now considering 182/374 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10895976532540286814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12308669245371583893.kers'
[2026-05-24 05:35:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10895976532540286814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12308669245371583893.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 127 cols 593 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 05:35:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12308669245371583893.kers
Total runtime 2 ms.
[2026-05-24 05:35:56] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 05:35:56] [INFO ] Invariant cache hit.
[2026-05-24 05:35:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 05:35:57] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-24 05:35:57] [INFO ] Invariant cache hit.
[2026-05-24 05:35:57] [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
All remaining problems are real, not stopping.
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 14084 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, Known Traps Along Path: 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 44183ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 44184ms
Starting structural reductions in LTL mode, iteration 1 : 127/192 places, 182/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45249 ms. Remains : 127/192 places, 182/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(!p0)))))'
Stuttering acceptance computed with spot in 197 ms :[false, (NOT p0), false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-11
Product exploration explored 100000 steps with 23017 reset in 410 ms.
Product exploration explored 100000 steps with 22907 reset in 447 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.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9162 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3861 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18814 steps, run visited all 1 properties in 82 ms. (steps per millisecond=229 )
Probabilistic random walk after 18814 steps, saw 9221 distinct states, run finished after 82 ms. (steps per millisecond=229 ) properties seen :1
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 393 ms.
Stuttering acceptance computed with spot in 50 ms :[(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 13 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-24 05:36:42] [INFO ] Invariant cache hit.
[2026-05-24 05:36:43] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-24 05:36:43] [INFO ] Invariant cache hit.
[2026-05-24 05:36:43] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 05:36:43] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2026-05-24 05:36:43] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1038 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.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9178 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3875 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18814 steps, run visited all 1 properties in 76 ms. (steps per millisecond=247 )
Probabilistic random walk after 18814 steps, saw 9221 distinct states, run finished after 76 ms. (steps per millisecond=247 ) properties seen :1
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 340 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23106 reset in 420 ms.
Product exploration explored 100000 steps with 22774 reset in 430 ms.
Built C files in :
/tmp/ltsmin10429943818387661839
[2026-05-24 05:36:45] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2026-05-24 05:36:45] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:36:45] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2026-05-24 05:36:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:36:45] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2026-05-24 05:36:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:36:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10429943818387661839
Running compilation step : cd /tmp/ltsmin10429943818387661839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 691 ms.
Running link step : cd /tmp/ltsmin10429943818387661839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin10429943818387661839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16386141758577007394.hoa' '--buchi-type=spotba'
LTSmin run took 269 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-11 finished in 50221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X((!p1&&X((!p1 U (p2||G(!p1))))))))))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 300
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 171 transition count 295
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 157 transition count 280
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 157 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 157 transition count 274
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 147 transition count 247
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 147 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 147 transition count 241
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 140 transition count 220
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 140 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 140 transition count 219
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 136 transition count 215
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 136 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 134 place count 136 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 135 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 135 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 134 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 134 transition count 208
Applied a total of 138 rules in 23 ms. Remains 134 /192 variables (removed 58) and now considering 208/374 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3044181038362759847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-710265580891584278.kers'
[2026-05-24 05:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3044181038362759847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-710265580891584278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 134 cols 653 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 05:36:46] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-710265580891584278.kers
Total runtime 2 ms.
[2026-05-24 05:36:46] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 05:36:46] [INFO ] Invariant cache hit.
[2026-05-24 05:36:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 05:36:47] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-24 05:36:47] [INFO ] Invariant cache hit.
[2026-05-24 05:36:47] [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, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/342 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 81/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/342 variables, and 222 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30012 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: 207/207 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/342 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 81/222 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 207/429 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 429 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30013 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: 207/207 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 134/192 places, 208/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61399 ms. Remains : 134/192 places, 208/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((p0&&X((p0 U (p1||G(p0))))))))||p2))))'
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-12
Product exploration explored 100000 steps with 22989 reset in 336 ms.
Product exploration explored 100000 steps with 23125 reset in 452 ms.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 498 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 20 stable transitions
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9137 resets) in 302 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1766 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1772 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1797 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1742 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 21906 steps, run visited all 5 properties in 332 ms. (steps per millisecond=65 )
Probabilistic random walk after 21906 steps, saw 10791 distinct states, run finished after 333 ms. (steps per millisecond=65 ) properties seen :5
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1146 ms.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2026-05-24 05:37:50] [INFO ] Invariant cache hit.
[2026-05-24 05:37:50] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-24 05:37:50] [INFO ] Invariant cache hit.
[2026-05-24 05:37:50] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 05:37:51] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 134/134 places, 208/208 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 498 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 20 stable transitions
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9181 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1803 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1797 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1774 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 21906 steps, run visited all 5 properties in 271 ms. (steps per millisecond=80 )
Probabilistic random walk after 21906 steps, saw 10791 distinct states, run finished after 271 ms. (steps per millisecond=80 ) properties seen :5
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1114 ms.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22949 reset in 323 ms.
Product exploration explored 100000 steps with 22981 reset in 441 ms.
Spot run failed in 53 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14744510345398005155
[2026-05-24 05:37:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14744510345398005155
Running compilation step : cd /tmp/ltsmin14744510345398005155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 575 ms.
Running link step : cd /tmp/ltsmin14744510345398005155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14744510345398005155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7711911243383497083.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-12 finished in 68251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 170 transition count 287
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 170 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 170 transition count 282
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 156 transition count 267
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 156 transition count 267
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 156 transition count 259
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 145 transition count 225
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 145 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 145 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 137 transition count 203
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 137 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 137 transition count 200
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 133 transition count 196
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 133 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 142 place count 133 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 132 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 132 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 131 transition count 189
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 131 transition count 189
Applied a total of 146 rules in 18 ms. Remains 131 /192 variables (removed 61) and now considering 189/374 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14428018340363333052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7400528017999198388.kers'
[2026-05-24 05:37:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14428018340363333052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7400528017999198388.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 131 cols 617 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 05:37:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7400528017999198388.kers
Total runtime 2 ms.
[2026-05-24 05:37:54] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-24 05:37:54] [INFO ] Invariant cache hit.
[2026-05-24 05:37:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-24 05:37:55] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-24 05:37:55] [INFO ] Invariant cache hit.
[2026-05-24 05:37:55] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/320 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 63/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 196 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/320 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 63/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 188/384 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 384 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46889ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 46890ms
Starting structural reductions in LTL mode, iteration 1 : 131/192 places, 189/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48180 ms. Remains : 131/192 places, 189/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 475 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 6 factoid took 50 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-13 finished in 49109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 374/374 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 168 transition count 284
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 168 transition count 284
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 168 transition count 278
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 152 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 152 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 152 transition count 253
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 139 transition count 216
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 139 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 139 transition count 210
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 135 place count 130 transition count 185
Iterating global reduction 3 with 9 rules applied. Total rules applied 144 place count 130 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 130 transition count 182
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 151 place count 126 transition count 178
Iterating global reduction 4 with 4 rules applied. Total rules applied 155 place count 126 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 159 place count 126 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 125 transition count 173
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 124 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 124 transition count 171
Applied a total of 163 rules in 34 ms. Remains 124 /192 variables (removed 68) and now considering 171/374 (removed 203) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8822118729644336688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16912841295894232882.kers'
[2026-05-24 05:38:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8822118729644336688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16912841295894232882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 568 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-24 05:38:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16912841295894232882.kers
Total runtime 2 ms.
[2026-05-24 05:38:43] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-24 05:38:43] [INFO ] Invariant cache hit.
[2026-05-24 05:38:44] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:38:44] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2026-05-24 05:38:44] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-24 05:38:44] [INFO ] Invariant cache hit.
[2026-05-24 05:38:44] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 180 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/295 variables, 124/128 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 52/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 170/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 350 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/192 places, 171/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60992 ms. Remains : 124/192 places, 171/374 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-14
Product exploration explored 100000 steps with 22963 reset in 224 ms.
Product exploration explored 100000 steps with 23031 reset in 241 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 445 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9153 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1748 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8548 steps, run visited all 1 properties in 27 ms. (steps per millisecond=316 )
Probabilistic random walk after 8548 steps, saw 4017 distinct states, run finished after 27 ms. (steps per millisecond=316 ) properties seen :1
Knowledge based reduction with 3 factoid took 55 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)]
Knowledge-based reduction took 259 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 171/171 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2026-05-24 05:39:45] [INFO ] Invariant cache hit.
[2026-05-24 05:39:45] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-24 05:39:45] [INFO ] Invariant cache hit.
[2026-05-24 05:39:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:39:46] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2026-05-24 05:39:46] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 690 ms. Remains : 124/124 places, 171/171 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 445 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9233 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8548 steps, run visited all 1 properties in 43 ms. (steps per millisecond=198 )
Probabilistic random walk after 8548 steps, saw 4017 distinct states, run finished after 43 ms. (steps per millisecond=198 ) properties seen :1
Knowledge based reduction with 3 factoid took 59 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)]
Knowledge-based reduction took 278 ms.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22822 reset in 387 ms.
Product exploration explored 100000 steps with 22959 reset in 264 ms.
Built C files in :
/tmp/ltsmin8595452016718864325
[2026-05-24 05:39:47] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2026-05-24 05:39:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:39:47] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2026-05-24 05:39:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:39:47] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2026-05-24 05:39:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:39:47] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8595452016718864325
Running compilation step : cd /tmp/ltsmin8595452016718864325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 550 ms.
Running link step : cd /tmp/ltsmin8595452016718864325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8595452016718864325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15589683862764979112.hoa' '--buchi-type=spotba'
LTSmin run took 11812 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-14 finished in 76106 ms.
All properties solved by simple procedures.
Total runtime 782079 ms.

BK_STOP 1779601199756

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-d2m05"
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-5973"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m05, 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 r082-smll-177946993600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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