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.r114-smll-177955740700564.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 ErlangenMainframeV0-PT-1400, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740700564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 77M
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 05:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 09:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Mar 7 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 77M 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 ErlangenMainframeV0-PT-1400-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1400-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779969030598

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1400
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-28 11:50:32] [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-28 11:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 11:50:37] [INFO ] Load time of PNML (sax parser for PT used): 4216 ms
[2026-05-28 11:50:37] [INFO ] Transformed 299 places.
[2026-05-28 11:50:37] [INFO ] Transformed 49450 transitions.
[2026-05-28 11:50:37] [INFO ] Found NUPN structural information;
[2026-05-28 11:50:37] [INFO ] Parsed PT model containing 299 places and 49450 transitions and 1540891 arcs in 4902 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4 places in 240 ms
Reduce places removed 4 places and 4 transitions.
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 49446/49446 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 293 transition count 49446
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 226 transition count 49379
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 226 transition count 49379
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 176 place count 186 transition count 49339
Iterating global reduction 1 with 40 rules applied. Total rules applied 216 place count 186 transition count 49339
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 219 place count 183 transition count 49336
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 183 transition count 49336
Applied a total of 222 rules in 2284 ms. Remains 183 /295 variables (removed 112) and now considering 49336/49446 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17277987716152689125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17704123822093955640.kers'
[2026-05-28 11:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17277987716152689125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17704123822093955640.kers]
Culled 0 columns in 454 ms.
// Phase 1: matrix 49336 rows 183 cols 1540661 entries
Finished phase 1 with 149 SingleSign rule and 2 generalized
[2026-05-28 11:50:43] [INFO ] Computed 32 invariants in 1473 ms
Computed 32 P flows in 1474 ms.
Exported basis to /tmp/petrispot-output-17704123822093955640.kers
Total runtime 1653 ms.
[2026-05-28 11:50:43] [INFO ] Implicit Places using invariants in 2348 ms returned []
Implicit Place search using SMT only with invariants took 2399 ms to find 0 implicit places.
Running 49335 sub problems to find dead transitions.
[2026-05-28 11:50:45] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 270756ms, After SMT, problems are : Problem set: 0 solved, 49335 unsolved
Search for dead transitions found 0 dead transitions in 271412ms
Starting structural reductions in LTL mode, iteration 1 : 183/295 places, 49336/49446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276516 ms. Remains : 183/295 places, 49336/49446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Applied a total of 0 rules in 328 ms. Remains 183 /183 variables (removed 0) and now considering 49336/49336 (removed 0) transitions.
[2026-05-28 11:55:16] [INFO ] Invariant cache hit.
[2026-05-28 11:55:16] [INFO ] Implicit Places using invariants in 193 ms returned []
Implicit Place search using SMT only with invariants took 195 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 183/183 places, 49336/49336 transitions.
Support contains 60 out of 183 places after structural reductions.
[2026-05-28 11:55:27] [INFO ] Flatten gal took : 10231 ms
[2026-05-28 11:55:37] [INFO ] Flatten gal took : 9488 ms
[2026-05-28 11:55:49] [INFO ] Input system was already deterministic with 49336 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 29761 ms. (1 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 202 ms. (19 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 307 ms. (13 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 72889 steps, run timeout after 27003 ms. (steps per millisecond=2 ) properties seen :0 out of 31
Probabilistic random walk after 72889 steps, saw 37551 distinct states, run finished after 27012 ms. (steps per millisecond=2 ) properties seen :0
[2026-05-28 11:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 88/148 variables, 16/30 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 148/49519 variables, and 30 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5531 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 88/148 variables, 16/30 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 148/49519 variables, and 30 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5441 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11820ms problems are : Problem set: 1 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Graph (trivial) has 86 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 23 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 181 transition count 49316
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 167 transition count 49316
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 29 place count 167 transition count 49293
Deduced a syphon composed of 23 places in 104 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 75 place count 144 transition count 49293
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 142 transition count 49276
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 142 transition count 49276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 142 transition count 49274
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 22 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 157 place count 104 transition count 49236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 103 transition count 49247
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 103 transition count 49243
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 169 place count 99 transition count 49241
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 99 transition count 49241
Partial Post-agglomeration rule applied 14 times.
Drop transitions (Partial Post agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 185 place count 99 transition count 49241
Applied a total of 185 rules in 16529 ms. Remains 99 /183 variables (removed 84) and now considering 49241/49336 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16532 ms. Remains : 99/183 places, 49241/49336 transitions.
RANDOM walk for 40000 steps (8 resets) in 46463 ms. (0 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 351 ms. (11 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 405 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 531 ms. (7 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 626 ms. (6 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 642 ms. (6 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 430 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 480 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 430 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 405 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 455 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 414 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 445 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 376 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 444 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 365 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 378 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 348 ms. (11 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 369 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 407 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 347 ms. (11 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 383 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 380 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 367 ms. (10 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 455 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 421 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 424 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 451 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 438 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 408 ms. (9 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 406 ms. (9 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 225574 steps, run timeout after 45001 ms. (steps per millisecond=5 ) properties seen :0 out of 30
Probabilistic random walk after 225574 steps, saw 32285 distinct states, run finished after 45002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-28 11:57:56] [INFO ] Flow matrix only has 49220 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17390199659855406061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18387198505719962053.kers'
[2026-05-28 11:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17390199659855406061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18387198505719962053.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 261 ms.
// Phase 1: matrix 49220 rows 97 cols 1540326 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-28 11:57:57] [INFO ] Computed 34 invariants in 1210 ms
Computed 34 P flows in 1211 ms.
Exported basis to /tmp/petrispot-output-18387198505719962053.kers
Total runtime 1539 ms.
[2026-05-28 11:57:58] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 6/66 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 6/72 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 27/99 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SMT process timed out in 47508ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 60 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 49241/49241 transitions.
Applied a total of 0 rules in 2240 ms. Remains 99 /99 variables (removed 0) and now considering 49241/49241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2240 ms. Remains : 99/99 places, 49241/49241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 49241/49241 transitions.
Applied a total of 0 rules in 2031 ms. Remains 99 /99 variables (removed 0) and now considering 49241/49241 (removed 0) transitions.
[2026-05-28 11:58:47] [INFO ] Flow matrix only has 49220 transitions (discarded 21 similar events)
[2026-05-28 11:58:47] [INFO ] Invariant cache hit.
[2026-05-28 11:58:47] [INFO ] Implicit Places using invariants in 170 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 279 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/99 places, 49241/49241 transitions.
Applied a total of 0 rules in 1987 ms. Remains 97 /97 variables (removed 0) and now considering 49241/49241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4318 ms. Remains : 97/99 places, 49241/49241 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 26 stabilizing places and 26 stable 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)||G(p1)))'
Support contains 41 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 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 180 transition count 49321
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 168 transition count 49321
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 168 transition count 49300
Deduced a syphon composed of 21 places in 103 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 147 transition count 49300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 145 transition count 49283
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 145 transition count 49283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 145 transition count 49281
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 21 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 159 place count 102 transition count 49238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 101 transition count 49249
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 172 place count 101 transition count 49249
Applied a total of 172 rules in 11903 ms. Remains 101 /183 variables (removed 82) and now considering 49249/49336 (removed 87) transitions.
[2026-05-28 11:59:03] [INFO ] Flow matrix only has 49229 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2859809577528087059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8102777724063222437.kers'
[2026-05-28 11:59:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2859809577528087059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8102777724063222437.kers]
Normalized transition count is 49228 out of 49229 initially.
Culled 0 columns in 294 ms.
// Phase 1: matrix 49228 rows 101 cols 1540406 entries
Finished phase 1 with 67 SingleSign rule and 2 generalized
[2026-05-28 11:59:05] [INFO ] Computed 32 invariants in 1317 ms
Computed 32 P flows in 1318 ms.
Exported basis to /tmp/petrispot-output-8102777724063222437.kers
Total runtime 1515 ms.
[2026-05-28 11:59:21] [INFO ] Implicit Places using invariants in 18476 ms returned []
Implicit Place search using SMT only with invariants took 18477 ms to find 0 implicit places.
Running 49247 sub problems to find dead transitions.
[2026-05-28 11:59:22] [INFO ] Flow matrix only has 49229 transitions (discarded 20 similar events)
[2026-05-28 11:59:22] [INFO ] Invariant cache hit.
[2026-05-28 11:59:22] [INFO ] State equation strengthened by 10 read => feed constraints.
SMT process timed out in 278803ms, After SMT, problems are : Problem set: 0 solved, 49247 unsolved
Search for dead transitions found 0 dead transitions in 279074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/183 places, 49249/49336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309618 ms. Remains : 101/183 places, 49249/49336 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)||G(p1)))'
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1400-LTLFireability-01
Product exploration timeout after 15090 steps with 0 reset in 10004 ms.
Product exploration timeout after 15390 steps with 0 reset in 10006 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 13 factoid took 64 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 46019 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4701 ms. (8 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 141067 steps, run timeout after 39002 ms. (steps per millisecond=3 ) properties seen :0 out of 1
Probabilistic random walk after 141067 steps, saw 21830 distinct states, run finished after 39004 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-28 12:05:16] [INFO ] Flow matrix only has 49229 transitions (discarded 20 similar events)
[2026-05-28 12:05:16] [INFO ] Invariant cache hit.
[2026-05-28 12:05:16] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/59 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/96 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5611ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 49249/49249 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 49245
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 4 place count 101 transition count 49237
Deduced a syphon composed of 8 places in 74 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 93 transition count 49237
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 34 place count 79 transition count 32854
Ensure Unique test removed 14 places
Iterating global reduction 1 with 28 rules applied. Total rules applied 62 place count 65 transition count 32854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 64 transition count 32853
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 64 transition count 32844
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 84 place count 55 transition count 32842
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 55 transition count 32842
Applied a total of 85 rules in 33282 ms. Remains 55 /101 variables (removed 46) and now considering 32842/49249 (removed 16407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33287 ms. Remains : 55/101 places, 32842/49249 transitions.
RANDOM walk for 1239 steps (0 resets) in 1139 ms. (1 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 13 factoid took 37 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 93949 ms.
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1400-LTLFireability-01 finished in 424342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(p1)||G(!p2)) U X(p3))&&p0)))'
Support contains 38 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Applied a total of 0 rules in 578 ms. Remains 183 /183 variables (removed 0) and now considering 49336/49336 (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-11254407499698455528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11580604270809732122.kers'
[2026-05-28 12:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11254407499698455528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11580604270809732122.kers]
Culled 0 columns in 259 ms.
// Phase 1: matrix 49336 rows 183 cols 1540661 entries
Finished phase 1 with 149 SingleSign rule and 2 generalized
[2026-05-28 12:05:58] [INFO ] Computed 32 invariants in 1199 ms
Computed 32 P flows in 1199 ms.
Exported basis to /tmp/petrispot-output-11580604270809732122.kers
Total runtime 1419 ms.
[2026-05-28 12:06:17] [INFO ] Implicit Places using invariants in 20799 ms returned []
Implicit Place search using SMT only with invariants took 20801 ms to find 0 implicit places.
Running 49335 sub problems to find dead transitions.
[2026-05-28 12:06:17] [INFO ] Invariant cache hit.
SMT process timed out in 286790ms, After SMT, problems are : Problem set: 0 solved, 49335 unsolved
Search for dead transitions found 0 dead transitions in 287054ms
Finished structural reductions in LTL mode , in 1 iterations and 308536 ms. Remains : 183/183 places, 49336/49336 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(p1)||G(!p2)) U X(p3))&&p0)))'
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3)), p2, (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1400-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1400-LTLFireability-02 finished in 309405 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(G((X(X(X(p0))) U (p0 U !p1)))))))'
Support contains 24 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 169 transition count 32953
Ensure Unique test removed 14 places
Iterating global reduction 0 with 28 rules applied. Total rules applied 42 place count 155 transition count 32953
Applied a total of 42 rules in 5815 ms. Remains 155 /183 variables (removed 28) and now considering 32953/49336 (removed 16383) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3715921245691149085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18069356529129548074.kers'
[2026-05-28 12:11:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3715921245691149085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18069356529129548074.kers]
Culled 0 columns in 162 ms.
// Phase 1: matrix 32953 rows 155 cols 590405 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-28 12:11:11] [INFO ] Computed 18 invariants in 696 ms
Computed 18 P flows in 698 ms.
Exported basis to /tmp/petrispot-output-18069356529129548074.kers
Total runtime 809 ms.
[2026-05-28 12:11:20] [INFO ] Implicit Places using invariants in 9672 ms returned []
Implicit Place search using SMT only with invariants took 9677 ms to find 0 implicit places.
Running 32952 sub problems to find dead transitions.
[2026-05-28 12:11:21] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/33108 variables, and 0 constraints, problems are : Problem set: 0 solved, 32952 unsolved in 30679 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 32952/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 154/33108 variables, and 0 constraints, problems are : Problem set: 0 solved, 32952 unsolved in 30644 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 32808/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183936ms problems are : Problem set: 0 solved, 32952 unsolved
Search for dead transitions found 0 dead transitions in 184179ms
Starting structural reductions in LTL mode, iteration 1 : 155/183 places, 32953/49336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199733 ms. Remains : 155/183 places, 32953/49336 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(G((X(X(X(p0))) U (p0 U !p1)))))))'
Stuttering acceptance computed with spot in 409 ms :[p1, p1, p1, p1, (NOT p0), p1, (AND (NOT p0) p1), (NOT p0), (NOT p0), true, (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1400-LTLFireability-03
Product exploration timeout after 34160 steps with 0 reset in 10001 ms.
Product exploration timeout after 33290 steps with 0 reset in 10004 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 12 states, 19 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 19201 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1211 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1593 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1150 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1173 ms. (34 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 84110 steps, run timeout after 21002 ms. (steps per millisecond=4 ) properties seen :0 out of 4
Probabilistic random walk after 84110 steps, saw 42196 distinct states, run finished after 21002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 12:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/120 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/143 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5211ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 32953/32953 transitions.
Graph (trivial) has 93 edges and 155 vertex of which 4 / 155 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 153 transition count 32933
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 139 transition count 32933
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 29 place count 139 transition count 32909
Deduced a syphon composed of 24 places in 36 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 77 place count 115 transition count 32909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 113 transition count 32892
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 113 transition count 32892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 113 transition count 32890
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 22 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 169 place count 70 transition count 32847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 69 transition count 32858
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 177 place count 69 transition count 32852
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 185 place count 63 transition count 32850
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 63 transition count 32850
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 196 place count 63 transition count 32850
Applied a total of 196 rules in 10533 ms. Remains 63 /155 variables (removed 92) and now considering 32850/32953 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10535 ms. Remains : 63/155 places, 32850/32953 transitions.
RANDOM walk for 40000 steps (8 resets) in 34855 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 5465 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5068 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4938 ms. (8 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 288564 steps, run timeout after 42001 ms. (steps per millisecond=6 ) properties seen :0 out of 3
Probabilistic random walk after 288564 steps, saw 37336 distinct states, run finished after 42001 ms. (steps per millisecond=6 ) properties seen :0
[2026-05-28 12:16:26] [INFO ] Flow matrix only has 32829 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17440284094396194456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18300412000362244129.kers'
[2026-05-28 12:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17440284094396194456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18300412000362244129.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 204 ms.
// Phase 1: matrix 32829 rows 61 cols 950488 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-28 12:16:27] [INFO ] Computed 20 invariants in 670 ms
Computed 20 P flows in 671 ms.
Exported basis to /tmp/petrispot-output-18300412000362244129.kers
Total runtime 814 ms.
[2026-05-28 12:22:16] [INFO ] State equation strengthened by 28699 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/57 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/63 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 32829/32892 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 394450ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 47 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3567 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[p1, p1, p1, p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 499740 ms.
Stuttering acceptance computed with spot in 304 ms :[p1, p1, p1, p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Support contains 24 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 32953/32953 transitions.
Applied a total of 0 rules in 206 ms. Remains 155 /155 variables (removed 0) and now considering 32953/32953 (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-8087464319319880416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3404954043164529482.kers'
[2026-05-28 12:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8087464319319880416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3404954043164529482.kers]
Culled 0 columns in 172 ms.
// Phase 1: matrix 32953 rows 155 cols 590405 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-28 12:23:06] [INFO ] Computed 18 invariants in 757 ms
Computed 18 P flows in 761 ms.
Exported basis to /tmp/petrispot-output-3404954043164529482.kers
Total runtime 900 ms.
[2026-05-28 12:23:16] [INFO ] Implicit Places using invariants in 10256 ms returned []
Implicit Place search using SMT only with invariants took 10258 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10466 ms. Remains : 155/155 places, 32953/32953 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 21821 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1467 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1589 ms. (25 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 96227 steps, run timeout after 24002 ms. (steps per millisecond=4 ) properties seen :0 out of 2
Probabilistic random walk after 96227 steps, saw 45638 distinct states, run finished after 24002 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 12:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/143 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5203ms, 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 24 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 32953/32953 transitions.
Graph (trivial) has 93 edges and 155 vertex of which 4 / 155 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 153 transition count 32933
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 139 transition count 32933
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 29 place count 139 transition count 32909
Deduced a syphon composed of 24 places in 41 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 77 place count 115 transition count 32909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 113 transition count 32892
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 113 transition count 32892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 113 transition count 32890
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 20 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 169 place count 70 transition count 32847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 69 transition count 32858
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 177 place count 69 transition count 32852
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 185 place count 63 transition count 32850
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 63 transition count 32850
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 196 place count 63 transition count 32850
Applied a total of 196 rules in 10385 ms. Remains 63 /155 variables (removed 92) and now considering 32850/32953 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10387 ms. Remains : 63/155 places, 32850/32953 transitions.
RANDOM walk for 40000 steps (8 resets) in 36456 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5946 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5867 ms. (6 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 325454 steps, run timeout after 45001 ms. (steps per millisecond=7 ) properties seen :0 out of 2
Probabilistic random walk after 325454 steps, saw 41178 distinct states, run finished after 45001 ms. (steps per millisecond=7 ) properties seen :0
[2026-05-28 12:25:05] [INFO ] Flow matrix only has 32829 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9824025338854438188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13869644696924705934.kers'
[2026-05-28 12:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9824025338854438188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13869644696924705934.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 160 ms.
// Phase 1: matrix 32829 rows 61 cols 950488 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-28 12:25:05] [INFO ] Computed 20 invariants in 516 ms
Computed 20 P flows in 516 ms.
Exported basis to /tmp/petrispot-output-13869644696924705934.kers
Total runtime 650 ms.
[2026-05-28 12:30:38] [INFO ] State equation strengthened by 28699 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/57 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/63 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32829/32892 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 377852ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 3605 ms.
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[p1, p1, p1, p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 490956 ms.
Stuttering acceptance computed with spot in 374 ms :[p1, p1, p1, p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 378 ms :[p1, p1, p1, p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Product exploration timeout after 36100 steps with 0 reset in 10002 ms.
Product exploration timeout after 36110 steps with 0 reset in 10001 ms.
Spot run failed in 115 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/ltsmin4749681874831008515
[2026-05-28 12:31:48] [INFO ] Built C files in 850ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4749681874831008515
Running compilation step : cd /tmp/ltsmin4749681874831008515;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4749681874831008515;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4749681874831008515;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 24 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 32953/32953 transitions.
Applied a total of 0 rules in 149 ms. Remains 155 /155 variables (removed 0) and now considering 32953/32953 (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-13948619525594884446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11610211489205617417.kers'
[2026-05-28 12:31:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13948619525594884446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11610211489205617417.kers]
Culled 0 columns in 99 ms.
// Phase 1: matrix 32953 rows 155 cols 590405 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-28 12:31:52] [INFO ] Computed 18 invariants in 503 ms
Computed 18 P flows in 505 ms.
Exported basis to /tmp/petrispot-output-11610211489205617417.kers
Total runtime 588 ms.
[2026-05-28 12:32:02] [INFO ] Implicit Places using invariants in 10182 ms returned []
Implicit Place search using SMT only with invariants took 10188 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10342 ms. Remains : 155/155 places, 32953/32953 transitions.
Built C files in :
/tmp/ltsmin13422203115056284412
[2026-05-28 12:32:03] [INFO ] Built C files in 790ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13422203115056284412
Running compilation step : cd /tmp/ltsmin13422203115056284412;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13422203115056284412;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13422203115056284412;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-28 12:32:18] [INFO ] Flatten gal took : 4116 ms
[2026-05-28 12:32:21] [INFO ] Flatten gal took : 3259 ms
[2026-05-28 12:32:22] [INFO ] Time to serialize gal into /tmp/LTL241975420306967546.gal : 732 ms
[2026-05-28 12:32:22] [INFO ] Time to serialize properties into /tmp/LTL16395523500687606319.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/LTL241975420306967546.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15382906822158472078.hoa' '-atoms' '/tmp/LTL16395523500687606319.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
Detected timeout of ITS tools.
[2026-05-28 12:32:48] [INFO ] Flatten gal took : 2871 ms
[2026-05-28 12:32:51] [INFO ] Flatten gal took : 2791 ms
[2026-05-28 12:32:51] [INFO ] Time to serialize gal into /tmp/LTL5639737025306473072.gal : 643 ms
[2026-05-28 12:32:51] [INFO ] Time to serialize properties into /tmp/LTL13326537599751961482.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/LTL5639737025306473072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13326537599751961482.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
Detected timeout of ITS tools.
[2026-05-28 12:33:10] [INFO ] Flatten gal took : 3166 ms
[2026-05-28 12:33:10] [INFO ] Applying decomposition
[2026-05-28 12:33:13] [INFO ] Flatten gal took : 2809 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/graph15131326255196541929.txt' '-o' '/tmp/graph15131326255196541929.bin' '-w' '/tmp/graph15131326255196541929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15131326255196541929.bin' '-l' '-1' '-v' '-w' '/tmp/graph15131326255196541929.weights' '-q' '0' '-e' '0.001'
[2026-05-28 12:33:21] [INFO ] Decomposing Gal with order
[2026-05-28 12:33:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 12:33:41] [INFO ] Removed a total of 96702 redundant transitions.
[2026-05-28 12:33:43] [INFO ] Flatten gal took : 18526 ms
[2026-05-28 12:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2097 labels/synchronizations in 1997 ms.
[2026-05-28 12:33:47] [INFO ] Time to serialize gal into /tmp/LTL13383800796376378005.gal : 47 ms
[2026-05-28 12:33:47] [INFO ] Time to serialize properties into /tmp/LTL12657024733540276513.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/LTL13383800796376378005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12657024733540276513.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((X(X(X("(((((i1.u36.p21==1)&&(u37.p38==1))&&((u37.p47==1)&&(i1.u36.p60==1)))&&(((i1.u25.p77==1)&&(i1.u25.p86==1))&&((i1.u25...953
Formula 0 simplified : XXXF(XXX!"(((((i1.u36.p21==1)&&(u37.p38==1))&&((u37.p47==1)&&(i1.u36.p60==1)))&&(((i1.u25.p77==1)&&(i1.u25.p86==1))&&((i1.u25.p103==...935
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1400-LTLFireability-03 finished in 1377528 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((G(p1)||p0))))'
Support contains 31 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Graph (trivial) has 101 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 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 180 transition count 49321
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 168 transition count 49321
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 25 place count 168 transition count 49299
Deduced a syphon composed of 22 places in 86 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 69 place count 146 transition count 49299
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 144 transition count 49282
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 144 transition count 49282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 144 transition count 49280
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 20 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 169 place count 97 transition count 49233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 96 transition count 49244
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 178 place count 96 transition count 49244
Applied a total of 178 rules in 15222 ms. Remains 96 /183 variables (removed 87) and now considering 49244/49336 (removed 92) transitions.
[2026-05-28 12:34:18] [INFO ] Flow matrix only has 49224 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5774617945721984113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7183085098979223346.kers'
[2026-05-28 12:34:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5774617945721984113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7183085098979223346.kers]
Normalized transition count is 49223 out of 49224 initially.
Culled 0 columns in 260 ms.
// Phase 1: matrix 49223 rows 96 cols 1507628 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-28 12:34:19] [INFO ] Computed 32 invariants in 1368 ms
Computed 32 P flows in 1368 ms.
Exported basis to /tmp/petrispot-output-7183085098979223346.kers
Total runtime 1541 ms.
[2026-05-28 12:34:48] [INFO ] Implicit Places using invariants in 30065 ms returned []
Implicit Place search using SMT only with invariants took 30069 ms to find 0 implicit places.
Running 49242 sub problems to find dead transitions.
[2026-05-28 12:34:48] [INFO ] Flow matrix only has 49224 transitions (discarded 20 similar events)
[2026-05-28 12:34:48] [INFO ] Invariant cache hit.
[2026-05-28 12:34:49] [INFO ] State equation strengthened by 16394 read => feed constraints.
SMT process timed out in 291509ms, After SMT, problems are : Problem set: 0 solved, 49242 unsolved
Search for dead transitions found 0 dead transitions in 291801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/183 places, 49244/49336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337184 ms. Remains : 96/183 places, 49244/49336 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1400-LTLFireability-04
Product exploration timeout after 13010 steps with 0 reset in 10016 ms.
Product exploration timeout after 12910 steps with 0 reset in 10008 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 66 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 50954 ms. (0 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3033 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3928 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3706 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2837 ms. (14 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 207586 steps, run timeout after 51001 ms. (steps per millisecond=4 ) properties seen :0 out of 4
Probabilistic random walk after 207586 steps, saw 28796 distinct states, run finished after 51001 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 12:41:10] [INFO ] Flow matrix only has 49224 transitions (discarded 20 similar events)
[2026-05-28 12:41:10] [INFO ] Invariant cache hit.
[2026-05-28 12:41:10] [INFO ] State equation strengthened by 16394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/52 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 34/91 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5568ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 49244/49244 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 49240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 96 transition count 49239
Deduced a syphon composed of 1 places in 31 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 95 transition count 49239
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 17 place count 95 transition count 49228
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 30 place count 84 transition count 49226
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 84 transition count 49226
Applied a total of 31 rules in 15106 ms. Remains 84 /96 variables (removed 12) and now considering 49226/49244 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15110 ms. Remains : 84/96 places, 49226/49244 transitions.
RANDOM walk for 40000 steps (8 resets) in 49597 ms. (0 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4333 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4229 ms. (9 steps per ms) remains 2/2 properties
[2026-05-28 12:41:48] [INFO ] Flow matrix only has 49205 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14450200588035583780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7066314440160668571.kers'
[2026-05-28 12:41:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14450200588035583780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7066314440160668571.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 271 ms.
// Phase 1: matrix 49205 rows 82 cols 1507528 entries
Finished phase 1 with 48 SingleSign rule and 2 generalized
[2026-05-28 12:41:49] [INFO ] Computed 34 invariants in 1423 ms
Computed 34 P flows in 1424 ms.
Exported basis to /tmp/petrispot-output-7066314440160668571.kers
Total runtime 1690 ms.
[2026-05-28 12:41:50] [INFO ] State equation strengthened by 16411 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/51 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/84 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 49289/49289 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34632 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 0/16411 constraints, PredecessorRefiner: 2/0 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/51 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/84 variables, 14/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 49289/49289 variables, and 118 constraints, problems are : Problem set: 1 solved, 1 unsolved in 27562 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 84/84 constraints, ReadFeed: 0/16411 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64662ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 49226/49226 transitions.
Graph (trivial) has 20 edges and 84 vertex of which 2 / 84 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 1441 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.449 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 2 place count 82 transition count 49201
Deduced a syphon composed of 7 places in 19 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 75 transition count 49201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 74 transition count 49200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 73 transition count 32808
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 73 transition count 32808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 73 transition count 32807
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 73 transition count 32799
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 45 place count 65 transition count 32791
Applied a total of 45 rules in 23714 ms. Remains 65 /84 variables (removed 19) and now considering 32791/49226 (removed 16435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23714 ms. Remains : 65/84 places, 32791/49226 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 79 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 196140 ms.
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1400-LTLFireability-04 finished in 553832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 22 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 169 transition count 32953
Ensure Unique test removed 14 places
Iterating global reduction 0 with 28 rules applied. Total rules applied 42 place count 155 transition count 32953
Applied a total of 42 rules in 5683 ms. Remains 155 /183 variables (removed 28) and now considering 32953/49336 (removed 16383) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4223685264113531110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14937503218368821197.kers'
[2026-05-28 12:43:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4223685264113531110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14937503218368821197.kers]
Culled 0 columns in 174 ms.
// Phase 1: matrix 32953 rows 155 cols 590405 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-28 12:43:23] [INFO ] Computed 18 invariants in 700 ms
Computed 18 P flows in 703 ms.
Exported basis to /tmp/petrispot-output-14937503218368821197.kers
Total runtime 831 ms.
[2026-05-28 12:43:36] [INFO ] Implicit Places using invariants in 13918 ms returned []
Implicit Place search using SMT only with invariants took 13920 ms to find 0 implicit places.
Running 32952 sub problems to find dead transitions.
[2026-05-28 12:43:36] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/33108 variables, and 0 constraints, problems are : Problem set: 0 solved, 32952 unsolved in 30707 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 32952/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 154/33108 variables, and 0 constraints, problems are : Problem set: 0 solved, 32952 unsolved in 30662 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 32808/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 196018ms problems are : Problem set: 0 solved, 32952 unsolved
Search for dead transitions found 0 dead transitions in 196350ms
Starting structural reductions in LTL mode, iteration 1 : 155/183 places, 32953/49336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216052 ms. Remains : 155/183 places, 32953/49336 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1400-LTLFireability-06
Product exploration timeout after 26670 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 3 ms.
FORMULA ErlangenMainframeV0-PT-1400-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1400-LTLFireability-06 finished in 226536 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 16 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 49336/49336 transitions.
Graph (trivial) has 101 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 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 180 transition count 49321
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 168 transition count 49321
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 25 place count 168 transition count 49299
Deduced a syphon composed of 22 places in 75 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 69 place count 146 transition count 49299
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 85 place count 130 transition count 32899
Ensure Unique test removed 14 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 115 place count 116 transition count 32899
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 116 transition count 32897
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 19 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 217 place count 66 transition count 32847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 65 transition count 32858
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 224 place count 65 transition count 32858
Applied a total of 224 rules in 13797 ms. Remains 65 /183 variables (removed 118) and now considering 32858/49336 (removed 16478) transitions.
[2026-05-28 12:47:16] [INFO ] Flow matrix only has 32838 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9696141096802284744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17836533384789373677.kers'
[2026-05-28 12:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9696141096802284744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17836533384789373677.kers]
Normalized transition count is 32837 out of 32838 initially.
Culled 0 columns in 225 ms.
// Phase 1: matrix 32837 rows 65 cols 1016104 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-28 12:47:17] [INFO ] Computed 18 invariants in 673 ms
Computed 18 P flows in 674 ms.
Exported basis to /tmp/petrispot-output-17836533384789373677.kers
Total runtime 807 ms.
[2026-05-28 12:47:38] [INFO ] Implicit Places using invariants in 21500 ms returned []
Implicit Place search using SMT only with invariants took 21501 ms to find 0 implicit places.
Running 32856 sub problems to find dead transitions.
[2026-05-28 12:47:38] [INFO ] Flow matrix only has 32838 transitions (discarded 20 similar events)
[2026-05-28 12:47:38] [INFO ] Invariant cache hit.
[2026-05-28 12:47:39] [INFO ] State equation strengthened by 16394 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 64/32903 variables, and 0 constraints, problems are : Problem set: 0 solved, 32856 unsolved in 30584 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/65 constraints, ReadFeed: 0/16394 constraints, PredecessorRefiner: 32856/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32856 unsolved

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-1400"
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 ErlangenMainframeV0-PT-1400, 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 r114-smll-177955740700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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