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.r034-tall-177946842100596.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 BusinessProcesses-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 189K 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 BusinessProcesses-PT-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779628675135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 13:17:56] [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 13:17:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:17:56] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-24 13:17:56] [INFO ] Transformed 772 places.
[2026-05-24 13:17:56] [INFO ] Transformed 685 transitions.
[2026-05-24 13:17:56] [INFO ] Found NUPN structural information;
[2026-05-24 13:17:56] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
Support contains 54 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 113 place count 644 transition count 565
Iterating global reduction 1 with 105 rules applied. Total rules applied 218 place count 644 transition count 565
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 269 place count 593 transition count 514
Iterating global reduction 1 with 51 rules applied. Total rules applied 320 place count 593 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 321 place count 592 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 322 place count 592 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 323 place count 591 transition count 512
Iterating global reduction 1 with 1 rules applied. Total rules applied 324 place count 591 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 325 place count 590 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 326 place count 590 transition count 511
Applied a total of 326 rules in 245 ms. Remains 590 /757 variables (removed 167) and now considering 511/670 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10981077424669411399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8079688541402606897.kers'
[2026-05-24 13:17:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10981077424669411399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8079688541402606897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 590 cols 1622 entries
Finished phase 1 with 385 SingleSign rule and 88 generalized
[2026-05-24 13:17:57] [INFO ] Computed 117 invariants in 4 ms
Computed 117 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8079688541402606897.kers
Total runtime 5 ms.
[2026-05-24 13:17:57] [INFO ] Implicit Places using invariants in 538 ms returned []
[2026-05-24 13:17:57] [INFO ] Invariant cache hit.
[2026-05-24 13:17:58] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2026-05-24 13:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/590 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1101 variables, and 176 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/590 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/590 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1101 variables, and 289 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/590 constraints, PredecessorRefiner: 0/510 constraints, Known Traps: 172/172 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 590/757 places, 511/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62481 ms. Remains : 590/757 places, 511/670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Applied a total of 0 rules in 14 ms. Remains 590 /590 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2026-05-24 13:18:59] [INFO ] Invariant cache hit.
[2026-05-24 13:18:59] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-24 13:18:59] [INFO ] Invariant cache hit.
[2026-05-24 13:19:00] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1775 ms. Remains : 590/590 places, 511/511 transitions.
Support contains 54 out of 590 places after structural reductions.
[2026-05-24 13:19:01] [INFO ] Flatten gal took : 68 ms
[2026-05-24 13:19:01] [INFO ] Flatten gal took : 31 ms
[2026-05-24 13:19:01] [INFO ] Input system was already deterministic with 511 transitions.
RANDOM walk for 40000 steps (218 resets) in 2308 ms. (17 steps per ms) remains 22/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
[2026-05-24 13:19:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 180/217 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 297/514 variables, 73/99 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 62/576 variables, 17/116 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/578 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 503/1081 variables, 578/695 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 11 (OVERLAPS) 17/1098 variables, 9/704 constraints. Problems are: Problem set: 3 solved, 19 unsolved
SMT process timed out in 5046ms, After SMT, problems are : Problem set: 3 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 511/511 transitions.
Graph (complete) has 1316 edges and 590 vertex of which 589 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 589 transition count 455
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 534 transition count 451
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 530 transition count 451
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 119 place count 530 transition count 333
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 373 place count 394 transition count 333
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 379 place count 388 transition count 327
Iterating global reduction 3 with 6 rules applied. Total rules applied 385 place count 388 transition count 327
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Deduced a syphon composed of 149 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 301 rules applied. Total rules applied 686 place count 236 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 236 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 689 place count 235 transition count 180
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 699 place count 235 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 700 place count 234 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 701 place count 233 transition count 179
Applied a total of 701 rules in 102 ms. Remains 233 /590 variables (removed 357) and now considering 179/511 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 233/590 places, 179/511 transitions.
RANDOM walk for 40000 steps (3542 resets) in 435 ms. (91 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4003 steps (74 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (79 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (81 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (76 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (84 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (80 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (81 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (78 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (74 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (80 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (65 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (78 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (84 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (81 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (74 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (81 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16985330133087671426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10119596670836026210.kers'
[2026-05-24 13:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16985330133087671426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10119596670836026210.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 0 ms.
// Phase 1: matrix 179 rows 193 cols 771 entries
Finished phase 1 with 111 SingleSign rule and 27 generalized
[2026-05-24 13:19:07] [INFO ] Computed 95 invariants in 1 ms
Computed 95 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10119596670836026210.kers
Total runtime 2 ms.
[2026-05-24 13:19:07] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 47/127 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 40/167 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 12/179 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 179/358 variables, 179/249 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 54/412 variables, 54/306 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 25/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/412 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 331 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 233/233 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 40/167 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 12/179 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 179/358 variables, 179/250 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 54/412 variables, 54/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 25/339 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 9/348 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/412 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 362 constraints, problems are : Problem set: 0 solved, 16 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 233/233 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8805ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 449 ms.
Support contains 23 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 179/179 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 233 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 178
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 225 transition count 173
Applied a total of 14 rules in 14 ms. Remains 225 /233 variables (removed 8) and now considering 173/179 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 225/233 places, 173/179 transitions.
RANDOM walk for 40000 steps (4284 resets) in 262 ms. (152 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (113 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (110 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (115 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (106 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (99 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (116 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (107 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (109 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (112 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (110 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (100 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (106 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (120 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (107 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (110 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (108 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 713087 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :14 out of 16
Probabilistic random walk after 713087 steps, saw 194164 distinct states, run finished after 3006 ms. (steps per millisecond=237 ) properties seen :14
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13557772697890204964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11908225759026480388.kers'
[2026-05-24 13:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13557772697890204964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11908225759026480388.kers]
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 173 rows 184 cols 757 entries
Finished phase 1 with 105 SingleSign rule and 27 generalized
[2026-05-24 13:19:20] [INFO ] Computed 93 invariants in 1 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11908225759026480388.kers
Total runtime 2 ms.
[2026-05-24 13:19:20] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/100 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/142 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 21/163 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 171/334 variables, 163/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/398 variables, 62/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 28/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 225/225 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/100 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/142 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/163 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 171/334 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/334 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 64/398 variables, 62/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 28/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/398 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 332 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 225/225 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1331ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 173/173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 223 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 223 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 35 place count 204 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 203 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 203 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 198 transition count 153
Applied a total of 47 rules in 20 ms. Remains 198 /225 variables (removed 27) and now considering 153/173 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 198/225 places, 153/173 transitions.
RANDOM walk for 40000 steps (5417 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1762 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1747 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 327011 steps, run visited all 2 properties in 1705 ms. (steps per millisecond=191 )
Probabilistic random walk after 327011 steps, saw 116096 distinct states, run finished after 1709 ms. (steps per millisecond=191 ) properties seen :2
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 533 stabilizing places and 464 stable transitions
Graph (complete) has 1316 edges and 590 vertex of which 589 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 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(G(p0))))'
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 501
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 578 transition count 499
Applied a total of 24 rules in 38 ms. Remains 578 /590 variables (removed 12) and now considering 499/511 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7855217024248364486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3461197299746694592.kers'
[2026-05-24 13:19:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7855217024248364486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3461197299746694592.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 499 rows 578 cols 1598 entries
Finished phase 1 with 373 SingleSign rule and 88 generalized
[2026-05-24 13:19:24] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3461197299746694592.kers
Total runtime 9 ms.
[2026-05-24 13:19:24] [INFO ] Implicit Places using invariants in 424 ms returned []
[2026-05-24 13:19:24] [INFO ] Invariant cache hit.
[2026-05-24 13:19:26] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-24 13:19:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 488 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 19 solved, 479 unsolved
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 177 constraints, problems are : Problem set: 20 solved, 478 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 60/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 473 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 28 solved, 470 unsolved
SMT process timed out in 60108ms, After SMT, problems are : Problem set: 28 solved, 470 unsolved
Search for dead transitions found 28 dead transitions in 60110ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/590 places, 471/511 transitions.
Applied a total of 0 rules in 18 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62353 ms. Remains : 578/590 places, 471/511 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(G(p0))))'
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 547 reset in 300 ms.
Product exploration explored 100000 steps with 555 reset in 252 ms.
Computed a total of 521 stabilizing places and 424 stable transitions
Graph (complete) has 1237 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 521 stabilizing places and 424 stable transitions
Detected a total of 521/578 stabilizing places and 424/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (218 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (39 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 822387 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Probabilistic random walk after 822387 steps, saw 125532 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2128408420269779186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5319792414010682006.kers'
[2026-05-24 13:20:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2128408420269779186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5319792414010682006.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 578 cols 1430 entries
Finished phase 1 with 372 SingleSign rule and 87 generalized
[2026-05-24 13:20:30] [INFO ] Computed 119 invariants in 4 ms
Computed 119 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5319792414010682006.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 475/498 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/562 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/566 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 463/1029 variables, 566/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/1046 variables, 9/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1046 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1049 variables, 3/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1049 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1049 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1049/1049 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 578/578 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 475/498 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/562 variables, 18/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/566 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 463/1029 variables, 566/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1029 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1029 variables, 7/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1029 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 17/1046 variables, 9/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1049 variables, 3/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1049 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1049 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1049/1049 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 578/578 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2479ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 471/471 transitions.
Graph (trivial) has 269 edges and 578 vertex of which 6 / 578 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1230 edges and 573 vertex of which 572 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 572 transition count 399
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 508 transition count 399
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 508 transition count 276
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 400 place count 361 transition count 276
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 725 place count 195 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 727 place count 194 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 729 place count 194 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 731 place count 192 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 192 transition count 118
Applied a total of 732 rules in 56 ms. Remains 192 /578 variables (removed 386) and now considering 118/471 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 192/578 places, 118/471 transitions.
RANDOM walk for 358 steps (17 resets) in 8 ms. (39 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 6032 ms.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 471/471 transitions.
Applied a total of 0 rules in 23 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-05-24 13:20:33] [INFO ] Invariant cache hit.
[2026-05-24 13:20:33] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-24 13:20:33] [INFO ] Invariant cache hit.
[2026-05-24 13:20:35] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned [158, 159, 160]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1726 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 575/578 places, 471/471 transitions.
Applied a total of 0 rules in 17 ms. Remains 575 /575 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1767 ms. Remains : 575/578 places, 471/471 transitions.
Computed a total of 518 stabilizing places and 424 stable transitions
Graph (complete) has 1222 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 518 stabilizing places and 424 stable transitions
Detected a total of 518/575 stabilizing places and 424/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (214 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (39 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 797315 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 1
Probabilistic random walk after 797315 steps, saw 122542 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4085380150137124797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6151679795138600376.kers'
[2026-05-24 13:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4085380150137124797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6151679795138600376.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 575 cols 1424 entries
Finished phase 1 with 374 SingleSign rule and 85 generalized
[2026-05-24 13:20:38] [INFO ] Computed 116 invariants in 10 ms
Computed 116 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-6151679795138600376.kers
Total runtime 12 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 444/467 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/542 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/563 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 463/1026 variables, 563/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1026 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/1043 variables, 9/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1043 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1046 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1046 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1046 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1046/1046 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 444/467 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/542 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/563 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 463/1026 variables, 563/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1026 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1026 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1026 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/1043 variables, 9/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1043 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1046 variables, 3/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1046 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 471/471 transitions.
Graph (trivial) has 269 edges and 575 vertex of which 6 / 575 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1215 edges and 570 vertex of which 569 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 569 transition count 399
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 505 transition count 399
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 505 transition count 276
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 400 place count 358 transition count 276
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 725 place count 192 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 727 place count 191 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 729 place count 191 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 731 place count 189 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 189 transition count 118
Applied a total of 732 rules in 43 ms. Remains 189 /575 variables (removed 386) and now considering 118/471 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 189/575 places, 118/471 transitions.
RANDOM walk for 303 steps (19 resets) in 5 ms. (50 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5794 ms.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 553 reset in 169 ms.
Product exploration explored 100000 steps with 552 reset in 198 ms.
Spot run failed in 77 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/ltsmin11861105187202646158
[2026-05-24 13:20:41] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11861105187202646158
Running compilation step : cd /tmp/ltsmin11861105187202646158;'/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 814 ms.
Running link step : cd /tmp/ltsmin11861105187202646158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11861105187202646158;'/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/stateBased3010661740067545712.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 471/471 transitions.
Applied a total of 0 rules in 13 ms. Remains 575 /575 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-05-24 13:20:56] [INFO ] Invariant cache hit.
[2026-05-24 13:20:57] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-24 13:20:57] [INFO ] Invariant cache hit.
[2026-05-24 13:20:58] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/575 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/1046 variables, and 176 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/575 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 60/176 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/1046 variables, and 261 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 145/145 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in LTL mode , in 1 iterations and 62135 ms. Remains : 575/575 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin6181954003612794214
[2026-05-24 13:21:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6181954003612794214
Running compilation step : cd /tmp/ltsmin6181954003612794214;'/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 714 ms.
Running link step : cd /tmp/ltsmin6181954003612794214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6181954003612794214;'/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/stateBased11140088666569265727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 13:22:13] [INFO ] Flatten gal took : 23 ms
[2026-05-24 13:22:13] [INFO ] Flatten gal took : 22 ms
[2026-05-24 13:22:13] [INFO ] Time to serialize gal into /tmp/LTL7332454482990545621.gal : 6 ms
[2026-05-24 13:22:13] [INFO ] Time to serialize properties into /tmp/LTL8559064428179012122.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7332454482990545621.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11655182310263670639.hoa' '-atoms' '/tmp/LTL8559064428179012122.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8559064428179012122.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11655182310263670639.hoa
Detected timeout of ITS tools.
[2026-05-24 13:22:29] [INFO ] Flatten gal took : 18 ms
[2026-05-24 13:22:29] [INFO ] Flatten gal took : 31 ms
[2026-05-24 13:22:29] [INFO ] Time to serialize gal into /tmp/LTL9655110989445289066.gal : 7 ms
[2026-05-24 13:22:29] [INFO ] Time to serialize properties into /tmp/LTL17324708154641041567.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9655110989445289066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17324708154641041567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p684==0)")))))
Formula 0 simplified : XXF!"(p684==0)"
Detected timeout of ITS tools.
[2026-05-24 13:22:44] [INFO ] Flatten gal took : 20 ms
[2026-05-24 13:22:44] [INFO ] Applying decomposition
[2026-05-24 13:22:44] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7775827958386122409.txt' '-o' '/tmp/graph7775827958386122409.bin' '-w' '/tmp/graph7775827958386122409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7775827958386122409.bin' '-l' '-1' '-v' '-w' '/tmp/graph7775827958386122409.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:22:44] [INFO ] Decomposing Gal with order
[2026-05-24 13:22:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:22:44] [INFO ] Removed a total of 166 redundant transitions.
[2026-05-24 13:22:44] [INFO ] Flatten gal took : 82 ms
[2026-05-24 13:22:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 15 ms.
[2026-05-24 13:22:44] [INFO ] Time to serialize gal into /tmp/LTL3025015036020835102.gal : 9 ms
[2026-05-24 13:22:44] [INFO ] Time to serialize properties into /tmp/LTL11638470725535728711.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3025015036020835102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11638470725535728711.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i9.i0.u177.p684==0)")))))
Formula 0 simplified : XXF!"(i9.i0.u177.p684==0)"
Reverse transition relation is NOT exact ! Due to transitions t10, t208, t293, t307, t315, t353, t398, t401, t474, t475, t479, t481, t483, t486, t488, t497...1579
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 215620 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((X(X(X((p0||(p1 U p2)))))&&(p1 U p3))))'
Support contains 6 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 581 transition count 502
Applied a total of 18 rules in 40 ms. Remains 581 /590 variables (removed 9) and now considering 502/511 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9101939085616334530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18180952712184630583.kers'
[2026-05-24 13:22:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9101939085616334530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18180952712184630583.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 502 rows 581 cols 1604 entries
Finished phase 1 with 376 SingleSign rule and 88 generalized
[2026-05-24 13:22:59] [INFO ] Computed 117 invariants in 10 ms
Computed 117 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-18180952712184630583.kers
Total runtime 12 ms.
[2026-05-24 13:23:00] [INFO ] Implicit Places using invariants in 413 ms returned []
[2026-05-24 13:23:00] [INFO ] Invariant cache hit.
[2026-05-24 13:23:02] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2026-05-24 13:23:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 11 solved, 490 unsolved
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 17 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 177 constraints, problems are : Problem set: 17 solved, 484 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 99/113 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 4/117 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 60/177 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/237 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/257 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/277 constraints. Problems are: Problem set: 17 solved, 484 unsolved
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 17 solved, 484 unsolved
Search for dead transitions found 17 dead transitions in 60207ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/590 places, 485/511 transitions.
Applied a total of 0 rules in 24 ms. Remains 581 /581 variables (removed 0) and now considering 485/485 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62710 ms. Remains : 581/590 places, 485/511 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((X(X(X((p0||(p1 U p2)))))&&(p1 U p3))))'
Stuttering acceptance computed with spot in 896 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-02
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-02 finished in 63702 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(X(F(p0)))))'
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 501
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 578 transition count 499
Applied a total of 24 rules in 38 ms. Remains 578 /590 variables (removed 12) and now considering 499/511 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13567118108260874500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2918918986238003840.kers'
[2026-05-24 13:24:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13567118108260874500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2918918986238003840.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 499 rows 578 cols 1598 entries
Finished phase 1 with 373 SingleSign rule and 88 generalized
[2026-05-24 13:24:03] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2918918986238003840.kers
Total runtime 6 ms.
[2026-05-24 13:24:03] [INFO ] Implicit Places using invariants in 398 ms returned []
[2026-05-24 13:24:03] [INFO ] Invariant cache hit.
[2026-05-24 13:24:05] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-24 13:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 488 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 19 solved, 479 unsolved
Problem TDEAD429 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 177 constraints, problems are : Problem set: 20 solved, 478 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 60/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 473 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 28 solved, 470 unsolved
SMT process timed out in 60199ms, After SMT, problems are : Problem set: 28 solved, 470 unsolved
Search for dead transitions found 28 dead transitions in 60200ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/590 places, 471/511 transitions.
Applied a total of 0 rules in 15 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62447 ms. Remains : 578/590 places, 471/511 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(X(F(p0)))))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 946 reset in 235 ms.
Stack based approach found an accepted trace after 2413 steps with 24 reset with depth 7 and stack size 7 in 7 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-03 finished in 62892 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||X(((p1 U p2) U (p0&&(p1 U p2)))))) U (F(p3) U X(p4))))'
Support contains 5 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 582 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 580 transition count 501
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 580 transition count 501
Applied a total of 20 rules in 43 ms. Remains 580 /590 variables (removed 10) and now considering 501/511 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8799105982955891602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18328159459359809952.kers'
[2026-05-24 13:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8799105982955891602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18328159459359809952.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 501 rows 580 cols 1602 entries
Finished phase 1 with 375 SingleSign rule and 88 generalized
[2026-05-24 13:25:06] [INFO ] Computed 117 invariants in 8 ms
Computed 117 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18328159459359809952.kers
Total runtime 10 ms.
[2026-05-24 13:25:06] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-05-24 13:25:06] [INFO ] Invariant cache hit.
[2026-05-24 13:25:08] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2026-05-24 13:25:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 177 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 60/177 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1081 variables, and 297 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 580/590 places, 501/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62402 ms. Remains : 580/590 places, 501/511 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||X(((p1 U p2) U (p0&&(p1 U p2)))))) U (F(p3) U X(p4))))'
Stuttering acceptance computed with spot in 628 ms :[(NOT p4), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p3) (NOT p4))), (AND (NOT p0) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), (NOT p4), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 178 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 63113 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(p1)) U (p2 U X(G(p3)))))'
Support contains 4 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 582 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 580 transition count 501
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 580 transition count 501
Applied a total of 20 rules in 40 ms. Remains 580 /590 variables (removed 10) and now considering 501/511 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17405432553216799143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7191027292751719010.kers'
[2026-05-24 13:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17405432553216799143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7191027292751719010.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 501 rows 580 cols 1602 entries
Finished phase 1 with 375 SingleSign rule and 88 generalized
[2026-05-24 13:26:09] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7191027292751719010.kers
Total runtime 9 ms.
[2026-05-24 13:26:09] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-24 13:26:09] [INFO ] Invariant cache hit.
[2026-05-24 13:26:11] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 580/590 places, 501/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2051 ms. Remains : 580/590 places, 501/511 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(p1)) U (p2 U X(G(p3)))))'
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 2481 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((X(X(p0))||G(p1))) U X(p2))))'
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 501
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 578 transition count 499
Applied a total of 24 rules in 49 ms. Remains 578 /590 variables (removed 12) and now considering 499/511 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13521056319961652896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9757067190741475344.kers'
[2026-05-24 13:26:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13521056319961652896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9757067190741475344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 499 rows 578 cols 1598 entries
Finished phase 1 with 373 SingleSign rule and 88 generalized
[2026-05-24 13:26:11] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9757067190741475344.kers
Total runtime 5 ms.
[2026-05-24 13:26:12] [INFO ] Implicit Places using invariants in 416 ms returned []
[2026-05-24 13:26:12] [INFO ] Invariant cache hit.
[2026-05-24 13:26:14] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-24 13:26:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 488 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 19 solved, 479 unsolved
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 177 constraints, problems are : Problem set: 20 solved, 478 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 60/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 473 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 28 solved, 470 unsolved
SMT process timed out in 60233ms, After SMT, problems are : Problem set: 28 solved, 470 unsolved
Search for dead transitions found 28 dead transitions in 60235ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/590 places, 471/511 transitions.
Applied a total of 0 rules in 14 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62492 ms. Remains : 578/590 places, 471/511 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((X(X(p0))||G(p1))) U X(p2))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 62673 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(((p0||X((p1&&F(G(p2))))) U X(X(X(p3))))))'
Support contains 9 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 581 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 579 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 579 transition count 500
Applied a total of 22 rules in 41 ms. Remains 579 /590 variables (removed 11) and now considering 500/511 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11110205115924456220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7093443759342899676.kers'
[2026-05-24 13:27:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11110205115924456220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7093443759342899676.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:27:14] [INFO ] Computed 117 invariants in 8 ms
Computed 117 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7093443759342899676.kers
Total runtime 11 ms.
[2026-05-24 13:27:14] [INFO ] Implicit Places using invariants in 383 ms returned []
[2026-05-24 13:27:14] [INFO ] Invariant cache hit.
[2026-05-24 13:27:16] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2026-05-24 13:27:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
SMT process timed out in 31944ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 31947ms
Starting structural reductions in LTL mode, iteration 1 : 579/590 places, 500/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33988 ms. Remains : 579/590 places, 500/511 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((p0&&F(G(p1))))||p2) U X(X(X(p3))))))'
Stuttering acceptance computed with spot in 727 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), true, (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 34767 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 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Graph (trivial) has 280 edges and 590 vertex of which 6 / 590 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 585 vertex of which 584 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 583 transition count 436
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 516 transition count 436
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 136 place count 516 transition count 314
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 404 place count 370 transition count 314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 414 place count 360 transition count 304
Iterating global reduction 2 with 10 rules applied. Total rules applied 424 place count 360 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 424 place count 360 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 428 place count 358 transition count 302
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 315 rules applied. Total rules applied 743 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 745 place count 197 transition count 150
Applied a total of 745 rules in 52 ms. Remains 197 /590 variables (removed 393) and now considering 150/511 (removed 361) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13019661354187527250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12599446817238305170.kers'
[2026-05-24 13:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13019661354187527250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12599446817238305170.kers]
Normalized transition count is 149 out of 150 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 149 rows 196 cols 902 entries
Finished phase 1 with 37 SingleSign rule and 72 generalized
[2026-05-24 13:27:49] [INFO ] Computed 88 invariants in 1 ms
Computed 88 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12599446817238305170.kers
Total runtime 2 ms.
[2026-05-24 13:27:49] [INFO ] Implicit Places using invariants in 222 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 157]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 224 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/590 places, 150/511 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 168/590 places, 150/511 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 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 21494 reset in 295 ms.
Product exploration explored 100000 steps with 21495 reset in 317 ms.
Computed a total of 145 stabilizing places and 132 stable transitions
Computed a total of 145 stabilizing places and 132 stable transitions
Detected a total of 145/168 stabilizing places and 132/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 50 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 (9752 resets) in 960 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3012 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 216 steps, run visited all 1 properties in 3 ms. (steps per millisecond=72 )
Probabilistic random walk after 216 steps, saw 139 distinct states, run finished after 3 ms. (steps per millisecond=72 ) properties seen :1
Knowledge based reduction with 4 factoid took 48 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 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 464 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 150/150 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7747577357283257117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3844318444523141051.kers'
[2026-05-24 13:27:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7747577357283257117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3844318444523141051.kers]
Normalized transition count is 149 out of 150 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 168 cols 784 entries
Finished phase 1 with 54 SingleSign rule and 55 generalized
[2026-05-24 13:27:50] [INFO ] Computed 59 invariants in 4 ms
Computed 59 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3844318444523141051.kers
Total runtime 6 ms.
[2026-05-24 13:27:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 13:27:50] [INFO ] Invariant cache hit.
[2026-05-24 13:27:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 13:27:51] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [1, 3, 5, 13, 36, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 62, 77, 79, 83, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 607 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/168 places, 150/150 transitions.
Graph (complete) has 425 edges and 134 vertex of which 123 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 123 transition count 133
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 111 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 110 transition count 132
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 40 place count 97 transition count 91
Iterating global reduction 3 with 13 rules applied. Total rules applied 53 place count 97 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 97 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 94 transition count 88
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 62 place count 91 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 65 place count 91 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 91 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 69 place count 90 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 84 place count 82 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 86 place count 81 transition count 74
Applied a total of 86 rules in 17 ms. Remains 81 /134 variables (removed 53) and now considering 74/150 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16403194145981277850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2433483421367563272.kers'
[2026-05-24 13:27:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16403194145981277850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2433483421367563272.kers]
Normalized transition count is 73 out of 74 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 81 cols 269 entries
Finished phase 1 with 57 SingleSign rule and 4 generalized
[2026-05-24 13:27:51] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2433483421367563272.kers
Total runtime 2 ms.
[2026-05-24 13:27:51] [INFO ] Implicit Places using invariants in 65 ms returned [7, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/168 places, 74/150 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 703 ms. Remains : 78/168 places, 74/150 transitions.
Computed a total of 55 stabilizing places and 56 stable transitions
Computed a total of 55 stabilizing places and 56 stable transitions
Detected a total of 55/78 stabilizing places and 56/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 48 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 (10059 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3071 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 164 steps, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Probabilistic random walk after 164 steps, saw 104 distinct states, run finished after 2 ms. (steps per millisecond=82 ) properties seen :1
Knowledge based reduction with 4 factoid took 62 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 65 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 211 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21802 reset in 90 ms.
Product exploration explored 100000 steps with 21965 reset in 99 ms.
Built C files in :
/tmp/ltsmin13072751418941514044
[2026-05-24 13:27:52] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2026-05-24 13:27:52] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:27:52] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2026-05-24 13:27:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:27:52] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2026-05-24 13:27:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:27:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13072751418941514044
Running compilation step : cd /tmp/ltsmin13072751418941514044;'/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 180 ms.
Running link step : cd /tmp/ltsmin13072751418941514044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13072751418941514044;'/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/stateBased14191569571161355234.hoa' '--buchi-type=spotba'
LTSmin run took 1500 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 4574 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 U p2))||p0)))'
Support contains 6 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 581 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 579 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 579 transition count 500
Applied a total of 22 rules in 74 ms. Remains 579 /590 variables (removed 11) and now considering 500/511 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6514063356411975407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12255609222215629288.kers'
[2026-05-24 13:27:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6514063356411975407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12255609222215629288.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:27:53] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12255609222215629288.kers
Total runtime 9 ms.
[2026-05-24 13:27:54] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-24 13:27:54] [INFO ] Invariant cache hit.
[2026-05-24 13:27:56] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 579/590 places, 500/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2530 ms. Remains : 579/590 places, 500/511 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 U p2))||p0)))'
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-11 finished in 2720 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) U X(X(p1))) U (p1&&(G(p1) U p2))))'
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 501
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 578 transition count 499
Applied a total of 24 rules in 54 ms. Remains 578 /590 variables (removed 12) and now considering 499/511 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9078506602237263254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2201975756947989278.kers'
[2026-05-24 13:27:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9078506602237263254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2201975756947989278.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 499 rows 578 cols 1598 entries
Finished phase 1 with 373 SingleSign rule and 88 generalized
[2026-05-24 13:27:56] [INFO ] Computed 117 invariants in 9 ms
Computed 117 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2201975756947989278.kers
Total runtime 11 ms.
[2026-05-24 13:27:56] [INFO ] Implicit Places using invariants in 422 ms returned []
[2026-05-24 13:27:56] [INFO ] Invariant cache hit.
[2026-05-24 13:27:58] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-24 13:27:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 488 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 19 solved, 479 unsolved
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 177 constraints, problems are : Problem set: 20 solved, 478 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 60/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 473 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 28 solved, 470 unsolved
SMT process timed out in 60196ms, After SMT, problems are : Problem set: 28 solved, 470 unsolved
Search for dead transitions found 28 dead transitions in 60198ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/590 places, 471/511 transitions.
Applied a total of 0 rules in 13 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62491 ms. Remains : 578/590 places, 471/511 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) U X(X(p1))) U (p1&&(G(p1) U p2))))'
Stuttering acceptance computed with spot in 514 ms :[(NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 63068 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(X(X(X(G(p0)))))||G(p1))))'
Support contains 2 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 581 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 579 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 579 transition count 500
Applied a total of 22 rules in 47 ms. Remains 579 /590 variables (removed 11) and now considering 500/511 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4414889264584181518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17856685650551830891.kers'
[2026-05-24 13:28:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4414889264584181518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17856685650551830891.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:28:59] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17856685650551830891.kers
Total runtime 9 ms.
[2026-05-24 13:29:00] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-05-24 13:29:00] [INFO ] Invariant cache hit.
[2026-05-24 13:29:01] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 579/590 places, 500/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2231 ms. Remains : 579/590 places, 500/511 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(X(X(X(G(p0)))))||G(p1))))'
Stuttering acceptance computed with spot in 503 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14
Product exploration explored 100000 steps with 553 reset in 196 ms.
Product exploration explored 100000 steps with 555 reset in 214 ms.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1296 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 12 states, 21 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (218 resets) in 169 ms. (235 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (38 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
[2026-05-24 13:29:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 447/499 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/561 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/567 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 492/1059 variables, 567/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/1076 variables, 9/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/1079 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 696 constraints, problems are : Problem set: 0 solved, 3 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 447/499 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/561 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 8/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/567 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 492/1059 variables, 567/698 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 2/700 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1059 variables, 1/701 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1059 variables, 0/701 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 17/1076 variables, 9/710 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1076 variables, 0/710 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1079 variables, 3/713 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/713 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1079 variables, 0/713 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 713 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2736 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3261ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 270 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1289 edges and 574 vertex of which 573 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 573 transition count 428
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 509 transition count 428
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 130 place count 509 transition count 304
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 403 place count 360 transition count 304
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 722 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 724 place count 197 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 197 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 728 place count 195 transition count 148
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 733 place count 195 transition count 148
Applied a total of 733 rules in 33 ms. Remains 195 /579 variables (removed 384) and now considering 148/500 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 195/579 places, 148/500 transitions.
RANDOM walk for 418 steps (15 resets) in 8 ms. (46 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4251 ms.
Stuttering acceptance computed with spot in 428 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 579 /579 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2026-05-24 13:29:07] [INFO ] Invariant cache hit.
[2026-05-24 13:29:07] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-24 13:29:07] [INFO ] Invariant cache hit.
[2026-05-24 13:29:09] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2191 ms. Remains : 579/579 places, 500/500 transitions.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1296 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (219 resets) in 143 ms. (277 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2026-05-24 13:29:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 447/498 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/561 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/567 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 492/1059 variables, 567/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/1076 variables, 9/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1079 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 447/498 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/561 variables, 15/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/567 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 492/1059 variables, 567/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1059 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1059 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1059 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 17/1076 variables, 9/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1076 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1079 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1079 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1079 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2373ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 271 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1289 edges and 574 vertex of which 573 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 573 transition count 428
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 509 transition count 428
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 130 place count 509 transition count 304
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 403 place count 360 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 359 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 359 transition count 303
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 724 place count 197 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 196 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 196 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 194 transition count 147
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 735 place count 194 transition count 147
Applied a total of 735 rules in 43 ms. Remains 194 /579 variables (removed 385) and now considering 147/500 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 194/579 places, 147/500 transitions.
RANDOM walk for 646 steps (38 resets) in 7 ms. (80 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3131 ms.
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 554 reset in 183 ms.
Product exploration explored 100000 steps with 554 reset in 208 ms.
Spot run failed in 47 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/ltsmin9010569443086270457
[2026-05-24 13:29:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9010569443086270457
Running compilation step : cd /tmp/ltsmin9010569443086270457;'/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 778 ms.
Running link step : cd /tmp/ltsmin9010569443086270457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9010569443086270457;'/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/stateBased15353363296132073064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 579 /579 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2026-05-24 13:29:29] [INFO ] Invariant cache hit.
[2026-05-24 13:29:29] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-24 13:29:29] [INFO ] Invariant cache hit.
[2026-05-24 13:29:31] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2226 ms. Remains : 579/579 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin8532698151223012273
[2026-05-24 13:29:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8532698151223012273
Running compilation step : cd /tmp/ltsmin8532698151223012273;'/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 819 ms.
Running link step : cd /tmp/ltsmin8532698151223012273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8532698151223012273;'/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/stateBased16603269457691644677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 13:29:46] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:29:46] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:29:46] [INFO ] Time to serialize gal into /tmp/LTL12935707407984025503.gal : 3 ms
[2026-05-24 13:29:46] [INFO ] Time to serialize properties into /tmp/LTL15359380013184369981.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12935707407984025503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11330829939189621847.hoa' '-atoms' '/tmp/LTL15359380013184369981.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15359380013184369981.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11330829939189621847.hoa
Detected timeout of ITS tools.
[2026-05-24 13:30:01] [INFO ] Flatten gal took : 28 ms
[2026-05-24 13:30:01] [INFO ] Flatten gal took : 14 ms
[2026-05-24 13:30:01] [INFO ] Time to serialize gal into /tmp/LTL1761973749035017023.gal : 2 ms
[2026-05-24 13:30:01] [INFO ] Time to serialize properties into /tmp/LTL15928374764054096578.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1761973749035017023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15928374764054096578.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X(X(X(G("(p579==0)"))))))||(G("(p178==0)")))))
Formula 0 simplified : X(XXXXF!"(p579==0)" & F!"(p178==0)")
Detected timeout of ITS tools.
[2026-05-24 13:30:16] [INFO ] Flatten gal took : 18 ms
[2026-05-24 13:30:16] [INFO ] Applying decomposition
[2026-05-24 13:30:16] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13054140878419815132.txt' '-o' '/tmp/graph13054140878419815132.bin' '-w' '/tmp/graph13054140878419815132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13054140878419815132.bin' '-l' '-1' '-v' '-w' '/tmp/graph13054140878419815132.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:30:16] [INFO ] Decomposing Gal with order
[2026-05-24 13:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:30:16] [INFO ] Removed a total of 291 redundant transitions.
[2026-05-24 13:30:16] [INFO ] Flatten gal took : 42 ms
[2026-05-24 13:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 26 ms.
[2026-05-24 13:30:16] [INFO ] Time to serialize gal into /tmp/LTL13143291206963418650.gal : 9 ms
[2026-05-24 13:30:16] [INFO ] Time to serialize properties into /tmp/LTL8943974480930368582.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13143291206963418650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8943974480930368582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(X(X(X(G("(i20.u158.p579==0)"))))))||(G("(i19.i2.u59.p178==0)")))))
Formula 0 simplified : X(XXXXF!"(i20.u158.p579==0)" & F!"(i19.i2.u59.p178==0)")
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t208, t293, t311, t315, t324, t353, t398, t401, t475, t479, t481, t483, t486...1582
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 92323 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((!p0 U (!p1||G(!p0))))))))'
Support contains 7 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 511/511 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 580 transition count 501
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 579 transition count 500
Applied a total of 22 rules in 36 ms. Remains 579 /590 variables (removed 11) and now considering 500/511 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12782290143489064169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17674696058309484717.kers'
[2026-05-24 13:30:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12782290143489064169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17674696058309484717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:30:31] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17674696058309484717.kers
Total runtime 4 ms.
[2026-05-24 13:30:32] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-05-24 13:30:32] [INFO ] Invariant cache hit.
[2026-05-24 13:30:34] [INFO ] Implicit Places using invariants and state equation in 2335 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 579/590 places, 500/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 579/590 places, 500/511 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((X((!p0 U (!p1||G(!p0))))&&!p0))))'
Stuttering acceptance computed with spot in 106 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 551 reset in 185 ms.
Product exploration explored 100000 steps with 554 reset in 248 ms.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1296 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 80 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (217 resets) in 237 ms. (168 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (39 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (39 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2026-05-24 13:30:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 403/501 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/561 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/567 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/1059 variables, 567/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1076 variables, 9/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/1079 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 696 constraints, problems are : Problem set: 0 solved, 2 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 403/501 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 19/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 60/561 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6006ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (complete) has 1296 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 578 transition count 439
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 518 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 516 transition count 437
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 125 place count 516 transition count 311
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 402 place count 365 transition count 311
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 319 rules applied. Total rules applied 721 place count 204 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 722 place count 204 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 724 place count 203 transition count 155
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 730 place count 203 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 731 place count 202 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 732 place count 201 transition count 154
Applied a total of 732 rules in 34 ms. Remains 201 /579 variables (removed 378) and now considering 154/500 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 201/579 places, 154/500 transitions.
RANDOM walk for 40000 steps (4756 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1362 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1372 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 151164 steps, run visited all 2 properties in 686 ms. (steps per millisecond=220 )
Probabilistic random walk after 151164 steps, saw 42437 distinct states, run finished after 686 ms. (steps per millisecond=220 ) properties seen :2
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (AND p0 p1), false]
Knowledge-based reduction took 7452 ms.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, (AND p0 p1), false]
Support contains 7 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (complete) has 1296 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 577 transition count 438
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 517 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 515 transition count 436
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 125 place count 515 transition count 310
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 402 place count 364 transition count 310
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 317 rules applied. Total rules applied 719 place count 204 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 720 place count 204 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 722 place count 203 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 723 place count 202 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 724 place count 201 transition count 154
Applied a total of 724 rules in 40 ms. Remains 201 /579 variables (removed 378) and now considering 154/500 (removed 346) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7475814395949420249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6441076185819088111.kers'
[2026-05-24 13:30:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7475814395949420249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6441076185819088111.kers]
Culling duplicate invariants (modulo rational): removing 43 columns.
Culled 43 columns in 0 ms.
// Phase 1: matrix 154 rows 158 cols 691 entries
Finished phase 1 with 89 SingleSign rule and 24 generalized
[2026-05-24 13:30:42] [INFO ] Computed 88 invariants in 3 ms
Computed 88 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6441076185819088111.kers
Total runtime 4 ms.
[2026-05-24 13:30:43] [INFO ] Implicit Places using invariants in 168 ms returned [57, 58, 59, 60, 61, 62, 63]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 169 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/579 places, 154/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 194/579 places, 154/500 transitions.
Computed a total of 173 stabilizing places and 139 stable transitions
Computed a total of 173 stabilizing places and 139 stable transitions
Detected a total of 173/194 stabilizing places and 139/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 72 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4794 resets) in 220 ms. (180 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (1444 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1413 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8477814556735956808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7575626541926239623.kers'
[2026-05-24 13:30:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8477814556735956808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7575626541926239623.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 154 rows 158 cols 691 entries
Finished phase 1 with 58 SingleSign rule and 55 generalized
[2026-05-24 13:30:43] [INFO ] Computed 81 invariants in 2 ms
Computed 81 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7575626541926239623.kers
Total runtime 3 ms.
[2026-05-24 13:30:43] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/74 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/125 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/132 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/134 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 154/288 variables, 134/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/348 variables, 60/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 28/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/348 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 194/194 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/74 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/125 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/132 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/134 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 154/288 variables, 134/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 60/348 variables, 60/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 28/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 282 constraints, problems are : Problem set: 0 solved, 2 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 194/194 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 760ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 7 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 154/154 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 154
Applied a total of 1 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 194/194 places, 154/154 transitions.
RANDOM walk for 40000 steps (4765 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1381 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1415 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 151145 steps, run visited all 2 properties in 623 ms. (steps per millisecond=242 )
Probabilistic random walk after 151145 steps, saw 42431 distinct states, run finished after 623 ms. (steps per millisecond=242 ) properties seen :2
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p0, p0, (AND p0 p1), false]
Knowledge-based reduction took 2142 ms.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p1), false]
Product exploration explored 100000 steps with 12050 reset in 305 ms.
Product exploration explored 100000 steps with 11909 reset in 291 ms.
Built C files in :
/tmp/ltsmin15841986975632095886
[2026-05-24 13:30:46] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2026-05-24 13:30:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:30:46] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2026-05-24 13:30:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:30:46] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2026-05-24 13:30:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:30:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15841986975632095886
Running compilation step : cd /tmp/ltsmin15841986975632095886;'/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 350 ms.
Running link step : cd /tmp/ltsmin15841986975632095886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15841986975632095886;'/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/stateBased17182110146679482239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 154/154 transitions.
Applied a total of 0 rules in 4 ms. Remains 194 /194 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2026-05-24 13:31:01] [INFO ] Invariant cache hit.
[2026-05-24 13:31:01] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-24 13:31:01] [INFO ] Invariant cache hit.
[2026-05-24 13:31:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 13:31:02] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [58, 59, 61, 63, 65, 67, 69, 71, 73, 75, 80, 82, 84, 85, 100, 102, 106, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 898 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/194 places, 154/154 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 165 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 154 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 152 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 152 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 152 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 150 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 46 place count 142 transition count 131
Applied a total of 46 rules in 10 ms. Remains 142 /165 variables (removed 23) and now considering 131/154 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3591846254355291862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16480615097113368670.kers'
[2026-05-24 13:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3591846254355291862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16480615097113368670.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 131 rows 119 cols 587 entries
Finished phase 1 with 51 SingleSign rule and 37 generalized
[2026-05-24 13:31:02] [INFO ] Computed 54 invariants in 0 ms
Computed 54 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16480615097113368670.kers
Total runtime 1 ms.
[2026-05-24 13:31:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 13:31:02] [INFO ] Invariant cache hit.
[2026-05-24 13:31:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-24 13:31:02] [INFO ] Implicit Places using invariants and state equation in 357 ms returned [2, 3, 4, 5, 6, 8, 10, 21, 25, 26, 27, 28, 29, 51, 52, 53, 54]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 476 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/194 places, 131/154 transitions.
Graph (complete) has 450 edges and 125 vertex of which 114 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 103 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 103 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 103 transition count 87
Applied a total of 24 rules in 8 ms. Remains 103 /125 variables (removed 22) and now considering 87/131 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1133233730576050821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8029326950322461561.kers'
[2026-05-24 13:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1133233730576050821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8029326950322461561.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 87 rows 93 cols 345 entries
Finished phase 1 with 56 SingleSign rule and 16 generalized
[2026-05-24 13:31:02] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8029326950322461561.kers
Total runtime 1 ms.
[2026-05-24 13:31:02] [INFO ] Implicit Places using invariants in 66 ms returned [15, 16, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 100/194 places, 87/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1473 ms. Remains : 100/194 places, 87/154 transitions.
Built C files in :
/tmp/ltsmin17713975925243663741
[2026-05-24 13:31:02] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2026-05-24 13:31:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:02] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2026-05-24 13:31:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:02] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2026-05-24 13:31:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17713975925243663741
Running compilation step : cd /tmp/ltsmin17713975925243663741;'/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 199 ms.
Running link step : cd /tmp/ltsmin17713975925243663741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17713975925243663741;'/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/stateBased11075289936331862294.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 13:31:17] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:31:17] [INFO ] Flatten gal took : 2 ms
[2026-05-24 13:31:17] [INFO ] Time to serialize gal into /tmp/LTL2070259163537125082.gal : 0 ms
[2026-05-24 13:31:17] [INFO ] Time to serialize properties into /tmp/LTL4698078092745824157.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2070259163537125082.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2432705036614365436.hoa' '-atoms' '/tmp/LTL4698078092745824157.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4698078092745824157.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2432705036614365436.hoa
Reverse transition relation is NOT exact ! Due to transitions t237.t238, t57.t58.t6, t40.t42.t43.t7, t37.t38.t8, t34.t35.t9, t31.t32.t10, t54.t153.t154.t32...1080
Computing Next relation with stutter on 83040 deadlock states
5 unique states visited
0 strongly connected components in search stack
7 transitions explored
4 items max in DFS search stack
76 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.785125,42348,1,0,363,128402,214,329,3411,134492,723
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-19-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 46725 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(G(p0))))'
Spot run failed in 49 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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(X(X(X(G(p0)))))||G(p1))))'
Spot run failed in 38 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 13:31:18] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17367619200473103506
[2026-05-24 13:31:18] [INFO ] Applying decomposition
[2026-05-24 13:31:18] [INFO ] Computing symmetric may disable matrix : 511 transitions.
[2026-05-24 13:31:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:18] [INFO ] Computing symmetric may enable matrix : 511 transitions.
[2026-05-24 13:31:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9669853651101622994.txt' '-o' '/tmp/graph9669853651101622994.bin' '-w' '/tmp/graph9669853651101622994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9669853651101622994.bin' '-l' '-1' '-v' '-w' '/tmp/graph9669853651101622994.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:31:18] [INFO ] Decomposing Gal with order
[2026-05-24 13:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:31:18] [INFO ] Computing Do-Not-Accords matrix : 511 transitions.
[2026-05-24 13:31:18] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 13:31:18] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17367619200473103506
Running compilation step : cd /tmp/ltsmin17367619200473103506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-24 13:31:18] [INFO ] Removed a total of 281 redundant transitions.
[2026-05-24 13:31:18] [INFO ] Flatten gal took : 22 ms
[2026-05-24 13:31:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 27 ms.
[2026-05-24 13:31:18] [INFO ] Time to serialize gal into /tmp/LTLFireability17918994085911588083.gal : 5 ms
[2026-05-24 13:31:18] [INFO ] Time to serialize properties into /tmp/LTLFireability11785582925460424821.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17918994085911588083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11785582925460424821.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G("(i1.u185.p684==0)")))))
Formula 0 simplified : XXF!"(i1.u185.p684==0)"
Compilation finished in 1202 ms.
Running link step : cd /tmp/ltsmin17367619200473103506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17367619200473103506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t208, t315, t320, t398, t401, t479, t481, t483, t486, t488, t497, t506, i0.i...1743
Computing Next relation with stutter on 109584 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3988 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,39.954,848480,1,0,1.49438e+06,1340,9107,4.11288e+06,346,5621,2797170
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((X(X(X(X(G("(i19.u162.p579==0)"))))))||(G("(i18.i0.u71.p178==0)")))))
Formula 1 simplified : X(XXXXF!"(i19.u162.p579==0)" & F!"(i18.i0.u71.p178==0)")
Computing Next relation with stutter on 109584 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
4056 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,80.5176,1505164,1,0,2.72737e+06,1378,9230,6.6553e+06,348,5912,4549723
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 892138 ms.

BK_STOP 1779629568491

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r034-tall-177946842100596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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