About the Execution of ITS-Tools for DiscoveryGPU-PT-13a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 828.384 | 99372.00 | 121791.00 | 377.50 | TTFTFFTFTFFFFFFF | normal |
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.r098-tall-177955695500347.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 DiscoveryGPU-PT-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.6K Mar 6 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 16:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 46K 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 DiscoveryGPU-PT-13a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779602355810
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 05:59:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 05:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:59:17] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2026-05-24 05:59:17] [INFO ] Transformed 133 places.
[2026-05-24 05:59:17] [INFO ] Transformed 183 transitions.
[2026-05-24 05:59:17] [INFO ] Found NUPN structural information;
[2026-05-24 05:59:17] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 123 transition count 173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 123 transition count 173
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 115 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 115 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 108 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 108 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 108 transition count 145
Applied a total of 56 rules in 36 ms. Remains 108 /133 variables (removed 25) and now considering 145/183 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17902945615779527527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3382107565568066302.kers'
[2026-05-24 05:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17902945615779527527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3382107565568066302.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 145 rows 106 cols 286 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-24 05:59:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3382107565568066302.kers
Total runtime 2 ms.
[2026-05-24 05:59:17] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-24 05:59:17] [INFO ] Invariant cache hit.
[2026-05-24 05:59:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-24 05:59:17] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-24 05:59:17] [INFO ] Invariant cache hit.
[2026-05-24 05:59:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/253 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 96/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 206 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/253 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 96/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 350 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4867 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9906ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 9924ms
Starting structural reductions in LTL mode, iteration 1 : 108/133 places, 145/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10396 ms. Remains : 108/133 places, 145/183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2026-05-24 05:59:27] [INFO ] Invariant cache hit.
[2026-05-24 05:59:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 05:59:27] [INFO ] Invariant cache hit.
[2026-05-24 05:59:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-24 05:59:27] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 108/108 places, 145/145 transitions.
Support contains 21 out of 108 places after structural reductions.
[2026-05-24 05:59:27] [INFO ] Flatten gal took : 27 ms
[2026-05-24 05:59:27] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:59:28] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 20 out of 108 places (down from 21) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 1769 steps (10 resets) in 106 ms. (16 steps per ms) remains 0/12 properties
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 328 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 104 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 101 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 99 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 99 transition count 136
Applied a total of 18 rules in 13 ms. Remains 99 /108 variables (removed 9) and now considering 136/145 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7303909736377475124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14279623465813830562.kers'
[2026-05-24 05:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7303909736377475124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14279623465813830562.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 136 rows 97 cols 270 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-24 05:59:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14279623465813830562.kers
Total runtime 1 ms.
[2026-05-24 05:59:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 05:59:28] [INFO ] Invariant cache hit.
[2026-05-24 05:59:28] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 05:59:28] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 136/145 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 232 ms. Remains : 98/108 places, 136/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 362 ms.
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 269 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 1345 steps (7 resets) in 29 ms. (44 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 281 ms.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 136/136 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 136/136 (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-10586738240364056505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13576518365847558810.kers'
[2026-05-24 05:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10586738240364056505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13576518365847558810.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 136 rows 97 cols 270 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-24 05:59:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13576518365847558810.kers
Total runtime 1 ms.
[2026-05-24 05:59:29] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 05:59:29] [INFO ] Invariant cache hit.
[2026-05-24 05:59:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 05:59:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-24 05:59:29] [INFO ] Invariant cache hit.
[2026-05-24 05:59:29] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/234 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 67/166 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 166 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/234 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 67/166 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 135/301 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 301 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8109ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 8109ms
Finished structural reductions in LTL mode , in 1 iterations and 8262 ms. Remains : 98/98 places, 136/136 transitions.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 269 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 1039 steps (5 resets) in 11 ms. (86 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 286 ms.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Product exploration explored 100000 steps with 25000 reset in 226 ms.
Spot run failed in 81 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/ltsmin3760184772454516638
[2026-05-24 05:59:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3760184772454516638
Running compilation step : cd /tmp/ltsmin3760184772454516638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin3760184772454516638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3760184772454516638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10654915439252780103.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-01 finished in 11560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 103 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 99 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 99 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 97 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 97 transition count 134
Applied a total of 22 rules in 11 ms. Remains 97 /108 variables (removed 11) and now considering 134/145 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9178069937908888138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8596147578173680132.kers'
[2026-05-24 05:59:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9178069937908888138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8596147578173680132.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 134 rows 95 cols 266 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-24 05:59:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8596147578173680132.kers
Total runtime 1 ms.
[2026-05-24 05:59:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 05:59:39] [INFO ] Invariant cache hit.
[2026-05-24 05:59:39] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 05:59:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-24 05:59:40] [INFO ] Invariant cache hit.
[2026-05-24 05:59:40] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 191 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 133/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 324 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8587ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 8588ms
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 134/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8771 ms. Remains : 97/108 places, 134/145 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((p0||X(p1)))))'
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-03
Product exploration explored 100000 steps with 726 reset in 186 ms.
Product exploration explored 100000 steps with 719 reset in 244 ms.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 14 stable transitions
Detected a total of 16/97 stabilizing places and 14/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 7 factoid took 56 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40004 steps (276 resets) in 266 ms. (149 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (19 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
[2026-05-24 05:59:49] [INFO ] Invariant cache hit.
[2026-05-24 05:59:49] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 8/231 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/97 constraints, ReadFeed: 2/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 75 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2026-05-24 05:59:49] [INFO ] Invariant cache hit.
[2026-05-24 05:59:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 05:59:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-24 05:59:49] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 05:59:49] [INFO ] [Real]Added 92 Read/Feed constraints in 10 ms returned sat
[2026-05-24 05:59:49] [INFO ] Computed and/alt/rep : 132/250/132 causal constraints (skipped 1 transitions) in 6 ms.
[2026-05-24 05:59:49] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Knowledge-based reduction took 593 ms.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-24 05:59:49] [INFO ] Invariant cache hit.
[2026-05-24 05:59:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 05:59:50] [INFO ] Invariant cache hit.
[2026-05-24 05:59:50] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 05:59:50] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 97/97 places, 134/134 transitions.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 14 stable transitions
Detected a total of 16/97 stabilizing places and 14/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 5 factoid took 57 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 241 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2026-05-24 05:59:50] [INFO ] Invariant cache hit.
[2026-05-24 05:59:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 05:59:50] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 05:59:50] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 05:59:50] [INFO ] [Real]Added 92 Read/Feed constraints in 9 ms returned sat
[2026-05-24 05:59:50] [INFO ] Computed and/alt/rep : 132/250/132 causal constraints (skipped 1 transitions) in 9 ms.
[2026-05-24 05:59:50] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Knowledge-based reduction took 468 ms.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 720 reset in 150 ms.
Product exploration explored 100000 steps with 719 reset in 165 ms.
Spot run failed in 50 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/ltsmin18107540988917658271
[2026-05-24 05:59:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18107540988917658271
Running compilation step : cd /tmp/ltsmin18107540988917658271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin18107540988917658271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18107540988917658271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5989767107110397489.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-24 06:00:06] [INFO ] Invariant cache hit.
[2026-05-24 06:00:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 06:00:06] [INFO ] Invariant cache hit.
[2026-05-24 06:00:06] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 06:00:06] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 97/97 places, 134/134 transitions.
Built C files in :
/tmp/ltsmin8843785416440005906
[2026-05-24 06:00:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8843785416440005906
Running compilation step : cd /tmp/ltsmin8843785416440005906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin8843785416440005906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8843785416440005906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2490574171049322424.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 06:00:21] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:00:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:00:21] [INFO ] Time to serialize gal into /tmp/LTL14370062517386097579.gal : 2 ms
[2026-05-24 06:00:21] [INFO ] Time to serialize properties into /tmp/LTL8943345041024335849.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14370062517386097579.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4617076665067185313.hoa' '-atoms' '/tmp/LTL8943345041024335849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8943345041024335849.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4617076665067185313.hoa
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t38, t40, t42, t44, t45, t47, t49, t51, t53, t55, t57, t129, t130, t131, t132, t133...311
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-24 06:00:36] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:00:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:00:36] [INFO ] Time to serialize gal into /tmp/LTL6857154947458629925.gal : 1 ms
[2026-05-24 06:00:36] [INFO ] Time to serialize properties into /tmp/LTL3317868855943458046.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/LTL6857154947458629925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3317868855943458046.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...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p132==1)")||(X("(p116==1)"))))))
Formula 0 simplified : XF(!"(p132==1)" & X!"(p116==1)")
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t38, t40, t42, t44, t45, t47, t49, t51, t53, t55, t57, t129, t130, t131, t132, t133...311
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-24 06:00:51] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:00:51] [INFO ] Applying decomposition
[2026-05-24 06:00:51] [INFO ] Flatten gal took : 5 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/graph17967791113989188575.txt' '-o' '/tmp/graph17967791113989188575.bin' '-w' '/tmp/graph17967791113989188575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17967791113989188575.bin' '-l' '-1' '-v' '-w' '/tmp/graph17967791113989188575.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:00:51] [INFO ] Decomposing Gal with order
[2026-05-24 06:00:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:00:51] [INFO ] Removed a total of 86 redundant transitions.
[2026-05-24 06:00:51] [INFO ] Flatten gal took : 55 ms
[2026-05-24 06:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 7 ms.
[2026-05-24 06:00:51] [INFO ] Time to serialize gal into /tmp/LTL15429465472748276819.gal : 3 ms
[2026-05-24 06:00:51] [INFO ] Time to serialize properties into /tmp/LTL13603937807775813135.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15429465472748276819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13603937807775813135.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(G(("(i4.u0.p132==1)")||(X("(i12.u34.p116==1)"))))))
Formula 0 simplified : XF(!"(i4.u0.p132==1)" & X!"(i12.u34.p116==1)")
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t38, t40, t44, t45, t47, t49, t51, t53, t55, t57, i0.u1.t136, i1.u4.t137, i2.u7.t13...410
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
98 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.00376,62784,1,0,64889,17111,1212,287021,204,166184,52551
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-03 finished in 73269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Graph (complete) has 328 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 124 edges and 103 vertex of which 94 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 105 edges and 94 vertex of which 52 / 94 are part of one of the 26 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 68 transition count 120
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 57 place count 55 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 68 place count 44 transition count 72
Iterating global reduction 2 with 11 rules applied. Total rules applied 79 place count 44 transition count 72
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 33 transition count 50
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 33 transition count 50
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 112 place count 22 transition count 28
Iterating global reduction 2 with 11 rules applied. Total rules applied 123 place count 22 transition count 28
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 134 place count 11 transition count 17
Iterating global reduction 2 with 11 rules applied. Total rules applied 145 place count 11 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 7 transition count 12
Applied a total of 152 rules in 24 ms. Remains 7 /108 variables (removed 101) and now considering 12/145 (removed 133) transitions.
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11627204713787119366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6487890306255752314.kers'
[2026-05-24 06:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11627204713787119366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6487890306255752314.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:00:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6487890306255752314.kers
Total runtime 1 ms.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 06:00:53] [INFO ] Invariant cache hit.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 06:00:53] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 06:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/15 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 95 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/108 places, 12/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 7/108 places, 12/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-04 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Graph (complete) has 328 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 124 edges and 103 vertex of which 94 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 104 edges and 94 vertex of which 50 / 94 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
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 18 rules applied. Total rules applied 19 place count 69 transition count 119
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 58 place count 55 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 45 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 45 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 35 transition count 54
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 35 transition count 54
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 108 place count 25 transition count 34
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 25 transition count 34
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 15 transition count 24
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 9 transition count 17
Applied a total of 148 rules in 20 ms. Remains 9 /108 variables (removed 99) and now considering 17/145 (removed 128) transitions.
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4010731480895732462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17881210201304371971.kers'
[2026-05-24 06:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4010731480895732462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17881210201304371971.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 06:00:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17881210201304371971.kers
Total runtime 0 ms.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 06:00:53] [INFO ] Invariant cache hit.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 06:00:53] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 06:00:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 06:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 73 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/21 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/108 places, 17/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 9/108 places, 17/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-05
Stuttering criterion allowed to conclude after 79 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-05 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(X(!p1)) U ((!p1&&X(X(!p1)))||X(X(G(!p1))))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 105 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 105 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 103 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 102 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 102 transition count 139
Applied a total of 12 rules in 15 ms. Remains 102 /108 variables (removed 6) and now considering 139/145 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10256489638091700709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14433369895929436528.kers'
[2026-05-24 06:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10256489638091700709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14433369895929436528.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 139 rows 100 cols 275 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-24 06:00:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14433369895929436528.kers
Total runtime 1 ms.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 06:00:53] [INFO ] Invariant cache hit.
[2026-05-24 06:00:53] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 06:00:53] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/108 places, 139/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 101/108 places, 139/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(X(!p1)) U ((!p1&&X(X(!p1)))||X(X(G(!p1))))))))'
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) p1), p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 51 steps with 12 reset in 3 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-07 finished in 598 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((F((G(p1)||G(p2)))&&p0)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 103 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 103 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 99 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 99 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 97 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 97 transition count 134
Applied a total of 22 rules in 6 ms. Remains 97 /108 variables (removed 11) and now considering 134/145 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13986725917188439595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17720194930178202500.kers'
[2026-05-24 06:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13986725917188439595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17720194930178202500.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 134 rows 95 cols 266 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-24 06:00:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17720194930178202500.kers
Total runtime 2 ms.
[2026-05-24 06:00:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 06:00:54] [INFO ] Invariant cache hit.
[2026-05-24 06:00:54] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 06:00:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 134/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 96/108 places, 134/145 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((F((G(p1)||G(p2)))&&p0)))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-09 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((p0 U p2)||p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 145/145 transitions.
Graph (complete) has 328 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 105 transition count 138
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 101 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 96 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 96 transition count 133
Applied a total of 19 rules in 21 ms. Remains 96 /108 variables (removed 12) and now considering 133/145 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1362869226446425288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17057072974560570385.kers'
[2026-05-24 06:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1362869226446425288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17057072974560570385.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 133 rows 94 cols 264 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-24 06:00:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17057072974560570385.kers
Total runtime 1 ms.
[2026-05-24 06:00:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 06:00:54] [INFO ] Invariant cache hit.
[2026-05-24 06:00:54] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 06:00:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/108 places, 133/145 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 71 transition count 109
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 60 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 60 transition count 87
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 50 transition count 67
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 50 transition count 67
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 41 transition count 58
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 41 transition count 58
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 117 place count 32 transition count 40
Iterating global reduction 0 with 9 rules applied. Total rules applied 126 place count 32 transition count 40
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 134 place count 24 transition count 32
Iterating global reduction 0 with 8 rules applied. Total rules applied 142 place count 24 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 24 transition count 32
Applied a total of 144 rules in 18 ms. Remains 24 /95 variables (removed 71) and now considering 32/133 (removed 101) transitions.
[2026-05-24 06:00:54] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18437355579546664908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17972375063281902211.kers'
[2026-05-24 06:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18437355579546664908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17972375063281902211.kers]
Normalized transition count is 26 out of 27 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 26 rows 23 cols 52 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 06:00:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17972375063281902211.kers
Total runtime 0 ms.
[2026-05-24 06:00:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 06:00:54] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2026-05-24 06:00:54] [INFO ] Invariant cache hit.
[2026-05-24 06:00:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 06:00:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/108 places, 32/145 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 24/108 places, 32/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((p0 U p2)||p1))))'
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 116 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-14 finished in 432 ms.
All properties solved by simple procedures.
Total runtime 98178 ms.
BK_STOP 1779602455182
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DiscoveryGPU-PT-13a"
export BK_EXAMINATION="LTLCardinality"
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 DiscoveryGPU-PT-13a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;
