About the Execution of ITS-Tools for DiscoveryGPU-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 545.516 | 81983.00 | 104050.00 | 254.20 | FFFFFFTTTTFFFFTF | 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-177955695400250.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400250
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 6 16:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 16:27 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.5K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 6 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 6 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 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 25K 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-07a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779594834819
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 03:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:53:56] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-24 03:53:56] [INFO ] Transformed 73 places.
[2026-05-24 03:53:56] [INFO ] Transformed 99 transitions.
[2026-05-24 03:53:56] [INFO ] Found NUPN structural information;
[2026-05-24 03:53:56] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 72 transition count 91
Applied a total of 9 rules in 20 ms. Remains 72 /73 variables (removed 1) and now considering 91/99 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16422461395773446546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8229517674846508657.kers'
[2026-05-24 03:53:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16422461395773446546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8229517674846508657.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 91 rows 70 cols 175 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 03:53:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8229517674846508657.kers
Total runtime 2 ms.
[2026-05-24 03:53:56] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 03:53:56] [INFO ] Invariant cache hit.
[2026-05-24 03:53:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 03:53:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-24 03:53:56] [INFO ] Invariant cache hit.
[2026-05-24 03:53:56] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/163 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 56/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 130 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/163 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 56/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 90/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 220 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2484 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5192ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5207ms
Starting structural reductions in LTL mode, iteration 1 : 72/73 places, 91/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5608 ms. Remains : 72/73 places, 91/99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-24 03:54:01] [INFO ] Invariant cache hit.
[2026-05-24 03:54:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 03:54:01] [INFO ] Invariant cache hit.
[2026-05-24 03:54:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 03:54:01] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 72/72 places, 91/91 transitions.
Support contains 58 out of 72 places after structural reductions.
[2026-05-24 03:54:02] [INFO ] Flatten gal took : 39 ms
[2026-05-24 03:54:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:54:02] [INFO ] Input system was already deterministic with 91 transitions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (529 resets) in 771 ms. (51 steps per ms) remains 2/68 properties
BEST_FIRST walk for 40004 steps (64 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (72 resets) in 85 ms. (465 steps per ms) remains 1/2 properties
[2026-05-24 03:54:02] [INFO ] Invariant cache hit.
[2026-05-24 03:54:02] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/33 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp43 is UNSAT
After SMT solving in domain Real declared 55/163 variables, and 39 constraints, problems are : Problem set: 1 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/72 constraints, ReadFeed: 13/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2026-05-24 03:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:54:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:54:02] [INFO ] Input system was already deterministic with 91 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 199 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 67 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 67 transition count 86
Applied a total of 10 rules in 4 ms. Remains 67 /72 variables (removed 5) and now considering 86/91 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6428940255867521181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2730107034039772985.kers'
[2026-05-24 03:54:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6428940255867521181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2730107034039772985.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 65 cols 168 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 03:54:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2730107034039772985.kers
Total runtime 2 ms.
[2026-05-24 03:54:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 03:54:02] [INFO ] Invariant cache hit.
[2026-05-24 03:54:02] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-24 03:54:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-24 03:54:02] [INFO ] Invariant cache hit.
[2026-05-24 03:54:02] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/153 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/153 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 123 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/153 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 85/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4080ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4081ms
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4188 ms. Remains : 67/72 places, 86/91 transitions.
[2026-05-24 03:54:07] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:54:07] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:07] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-24 03:54:07] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:54:07] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2895798253208760146.gal : 2 ms
[2026-05-24 03:54:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3361324853791857705.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2895798253208760146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3361324853791857705.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73804e+07,0.104764,8092,2,1274,5,26201,6,0,342,16539,0
Converting to forward existential form...Done !
original formula: AG((EX(((EX(((p18==0)||(p72==0))) * (((p44==0)||(p36==0))||(p71==0))) * (p21==1))) + (A(EF(!(((p30==1)&&(p71==1)))) U (p4!=1)) * ((!(E(((...430
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * !(EX(((EX(((p18==0)||(p72==0))) * (((p44==0)||(p36==0))||(p71==0))) * (p21==1))))),...1100
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t19, t69, t71, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, Intersection ...239
(forward)formula 0,0,2.53573,99000,1,0,543,543156,212,293,2049,711380,641
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Graph (complete) has 199 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 66 transition count 80
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 56 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 56 transition count 75
Applied a total of 21 rules in 17 ms. Remains 56 /72 variables (removed 16) and now considering 75/91 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15065206161633842465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6191286503362475525.kers'
[2026-05-24 03:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15065206161633842465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6191286503362475525.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 75 rows 54 cols 147 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:54:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6191286503362475525.kers
Total runtime 0 ms.
[2026-05-24 03:54:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 03:54:09] [INFO ] Invariant cache hit.
[2026-05-24 03:54:09] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:54:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-24 03:54:09] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-24 03:54:09] [INFO ] Invariant cache hit.
[2026-05-24 03:54:09] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 109 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 183 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3160ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3161ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/72 places, 75/91 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3285 ms. Remains : 56/72 places, 75/91 transitions.
[2026-05-24 03:54:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:54:12] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:12] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-24 03:54:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5393479062019545074.gal : 1 ms
[2026-05-24 03:54:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11119728605262295364.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5393479062019545074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11119728605262295364.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.12e+06,0.053924,6424,2,633,5,13853,6,0,290,9442,0
Converting to forward existential form...Done !
original formula: AG((A(((p29==1)&&(p71==1)) U (((p42==1)&&(p71==1))&&((p64==1)&&(p72==1)))) + AF(((p63==0)||(p72==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!((((p42==1)&&(p71==1))&&((p64==1)&&(p72==1)))) U (!(((p29==1)&&(p71==1))) * !((...293
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t23, t25, t27, t29, t61, t67, t68, t69, t70, t71, t72, t73, t74, Intersection with ...234
Hit Full ! (commute/partial/dont) 59/15/16
(forward)formula 0,0,0.85678,38900,1,0,366,201121,186,204,1831,257945,451
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 62 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 59 transition count 78
Applied a total of 26 rules in 5 ms. Remains 59 /72 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9321243228882086663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12643257929538558704.kers'
[2026-05-24 03:54:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9321243228882086663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12643257929538558704.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 57 cols 153 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-24 03:54:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12643257929538558704.kers
Total runtime 0 ms.
[2026-05-24 03:54:13] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 03:54:13] [INFO ] Invariant cache hit.
[2026-05-24 03:54:13] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:54:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-24 03:54:13] [INFO ] Invariant cache hit.
[2026-05-24 03:54:13] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/137 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 51/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 112 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/137 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 51/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 77/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 189 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3129ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3129ms
Starting structural reductions in LTL mode, iteration 1 : 59/72 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 59/72 places, 78/91 transitions.
[2026-05-24 03:54:17] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:54:17] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:54:17] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-24 03:54:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8683405065314240911.gal : 1 ms
[2026-05-24 03:54:17] [INFO ] Time to serialize properties into /tmp/CTLFireability987446593605335112.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8683405065314240911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability987446593605335112.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23636e+07,0.124196,9976,2,1438,5,37726,6,0,303,23585,0
Converting to forward existential form...Done !
original formula: EF((A(A(((p59==1)&&(p71==1)) U ((p29==1)&&(p71==1))) U A(((p53==1)&&(p72==1)) U (p21==1))) * AX(((p4==1) * EF((p16==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!(!((E(!((p21==1)) U (!(((p53==1)&&(p72==1))) * !((p21==1)))) + EG(!((p21==1)))))) U (...506
Reverse transition relation is NOT exact ! Due to transitions t3, t15, t19, t21, t24, t26, t28, t69, t70, t71, t72, t73, t74, t75, t76, t77, Intersection ...239
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.86123,166176,1,0,762,941655,206,456,1929,1.24355e+06,958
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 85
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 60 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 56 transition count 75
Applied a total of 32 rules in 11 ms. Remains 56 /72 variables (removed 16) and now considering 75/91 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11384427477612897249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6369466936799763680.kers'
[2026-05-24 03:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11384427477612897249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6369466936799763680.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 75 rows 54 cols 148 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:54:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6369466936799763680.kers
Total runtime 1 ms.
[2026-05-24 03:54:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 03:54:22] [INFO ] Invariant cache hit.
[2026-05-24 03:54:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:54:22] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-24 03:54:22] [INFO ] Invariant cache hit.
[2026-05-24 03:54:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 108 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 182 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3004ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3004ms
Starting structural reductions in LTL mode, iteration 1 : 56/72 places, 75/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3115 ms. Remains : 56/72 places, 75/91 transitions.
[2026-05-24 03:54:25] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:54:25] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:25] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-24 03:54:25] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:25] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15401622495063332400.gal : 0 ms
[2026-05-24 03:54:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16250085177914141995.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15401622495063332400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16250085177914141995.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05943e+07,0.093006,8200,2,1076,5,25501,6,0,289,17707,0
Converting to forward existential form...Done !
original formula: EX(AG(((p13==0)||(p72==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p13==0)||(p72==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t18, t20, t22, t23, t27, t29, t67, t68, t69, t70, t71, t72, t73, t74, Intersection...240
(forward)formula 0,0,0.488645,22668,1,0,113,111245,172,72,1760,98844,161
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 62 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 62 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 60 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 60 transition count 79
Applied a total of 24 rules in 6 ms. Remains 60 /72 variables (removed 12) and now considering 79/91 (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-526453172101891109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18230756460916549573.kers'
[2026-05-24 03:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-526453172101891109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18230756460916549573.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 79 rows 58 cols 155 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-24 03:54:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18230756460916549573.kers
Total runtime 0 ms.
[2026-05-24 03:54:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:54:25] [INFO ] Invariant cache hit.
[2026-05-24 03:54:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:54:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2026-05-24 03:54:25] [INFO ] Invariant cache hit.
[2026-05-24 03:54:25] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/139 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 113 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/139 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 78/191 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 191 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3231ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3235ms
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3325 ms. Remains : 60/72 places, 79/91 transitions.
[2026-05-24 03:54:28] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:54:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:29] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-24 03:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2339890925228489371.gal : 1 ms
[2026-05-24 03:54:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12145035972358090782.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2339890925228489371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12145035972358090782.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31609e+07,0.108697,9164,2,1265,5,32024,6,0,308,20876,0
Converting to forward existential form...Done !
original formula: (AG(((p61==0) * AF((((p8==0)||(p40==0))||((p71==0)||(p14==0)))))) * AX(((E(!((((EF((p4==1)) * (p55==1)) * ((p71==1)&&(p34==1))) * (p72==1...295
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !((p61==0)))] = FALSE * [FwdG(FwdU(Init,TRUE),!((((p8==0)||(p40==0))||((p71==0)||(p14==0))...414
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t16, t22, t24, t25, t29, t70, t71, t72, t73, t74, t75, t76, t77, t78, Intersection ...239
Hit Full ! (commute/partial/dont) 37/122/42
(forward)formula 0,0,0.799846,36704,1,0,140,190740,201,94,2080,196680,199
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 67 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 66 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 66 transition count 85
Applied a total of 12 rules in 4 ms. Remains 66 /72 variables (removed 6) and now considering 85/91 (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-508154330267577984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5842884309795421081.kers'
[2026-05-24 03:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-508154330267577984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5842884309795421081.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 85 rows 64 cols 165 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-24 03:54:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5842884309795421081.kers
Total runtime 0 ms.
[2026-05-24 03:54:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 03:54:29] [INFO ] Invariant cache hit.
[2026-05-24 03:54:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 03:54:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-24 03:54:29] [INFO ] Invariant cache hit.
[2026-05-24 03:54:29] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/151 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 121 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/151 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 84/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 205 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3549ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3551ms
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3665 ms. Remains : 66/72 places, 85/91 transitions.
[2026-05-24 03:54:33] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:54:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:54:33] [INFO ] Input system was already deterministic with 85 transitions.
[2026-05-24 03:54:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16073164675367599834.gal : 2 ms
[2026-05-24 03:54:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9542245519082010860.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16073164675367599834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9542245519082010860.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67453e+07,0.082937,7764,2,774,5,23521,6,0,336,14083,0
Converting to forward existential form...Done !
original formula: ((E(((p3==1)&&(p72==1)) U AG(((p26==1) + EF(((p9==1)&&(p71==1)))))) + A(!(EX((((p53==1)||(p21==1)) * A((p63==1) U (p18==1))))) U !(E((p26...246
=> equivalent forward existential formula: [((EY((Init * !((E(((p3==1)&&(p72==1)) U !(E(TRUE U !(((p26==1) + E(TRUE U ((p9==1)&&(p71==1)))))))) + !((E(!(!(...471
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t18, t29, t31, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, Intersection ...239
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.00175,114120,1,0,805,635749,224,509,2130,826544,925
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 85
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 60 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 56 transition count 75
Applied a total of 32 rules in 12 ms. Remains 56 /72 variables (removed 16) and now considering 75/91 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16122146478128715118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11748920548411008440.kers'
[2026-05-24 03:54:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16122146478128715118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11748920548411008440.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 75 rows 54 cols 148 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:54:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11748920548411008440.kers
Total runtime 0 ms.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
[2026-05-24 03:54:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:54:36] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-24 03:54:36] [INFO ] Invariant cache hit.
[2026-05-24 03:54:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 108 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 182 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2948ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Starting structural reductions in LTL mode, iteration 1 : 56/72 places, 75/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 56/72 places, 75/91 transitions.
[2026-05-24 03:54:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:39] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-24 03:54:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15258741754591200944.gal : 1 ms
[2026-05-24 03:54:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11706227052279164413.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15258741754591200944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11706227052279164413.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05943e+07,0.092829,8196,2,1076,5,25501,6,0,289,17707,0
Converting to forward existential form...Done !
original formula: EX(AX(EF((((p13==1)&&(p72==1))&&(p26==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U (((p13==1)&&(p72==1))&&(p26==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t18, t20, t22, t23, t27, t29, t67, t68, t69, t70, t71, t72, t73, t74, Intersection...240
(forward)formula 0,1,0.530447,24724,1,0,119,124551,171,75,1784,115054,165
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 67 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 67 transition count 86
Applied a total of 10 rules in 8 ms. Remains 67 /72 variables (removed 5) and now considering 86/91 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1361569913077024066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-690219742295192953.kers'
[2026-05-24 03:54:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1361569913077024066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-690219742295192953.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 65 cols 167 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 03:54:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-690219742295192953.kers
Total runtime 0 ms.
[2026-05-24 03:54:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:54:40] [INFO ] Invariant cache hit.
[2026-05-24 03:54:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 03:54:40] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-24 03:54:40] [INFO ] Invariant cache hit.
[2026-05-24 03:54:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/153 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 53/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/153 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 122 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/153 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 53/122 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 207 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3868ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3868ms
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3964 ms. Remains : 67/72 places, 86/91 transitions.
[2026-05-24 03:54:44] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:54:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:44] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-24 03:54:44] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:44] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13368026572969075490.gal : 1 ms
[2026-05-24 03:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6247998418318400134.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13368026572969075490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6247998418318400134.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7142e+07,0.097714,8704,2,1153,5,31906,6,0,341,17077,0
Converting to forward existential form...Done !
original formula: E(!(((((EX((p23==1)) * !(AX(((p38==1)&&(p72==1))))) * ((!(((p57==1)&&(p71==1))&&(p11==1)))&&((((p24==1)&&(p72==1))||(p51==1))||(p63==1)))...260
=> equivalent forward existential formula: [(FwdU(Init,!(((((EX((p23==1)) * !(!(EX(!(((p38==1)&&(p72==1))))))) * ((!(((p57==1)&&(p71==1))&&(p11==1)))&&((((...324
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t19, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, Intersection with r...233
(forward)formula 0,1,4.10422,147224,1,0,621,740610,205,362,2027,1.09992e+06,733
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 61 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 57 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 57 transition count 76
Applied a total of 30 rules in 5 ms. Remains 57 /72 variables (removed 15) and now considering 76/91 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5187025812884081785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12966129213081286995.kers'
[2026-05-24 03:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5187025812884081785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12966129213081286995.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 76 rows 55 cols 150 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-24 03:54:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12966129213081286995.kers
Total runtime 0 ms.
[2026-05-24 03:54:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:54:48] [INFO ] Invariant cache hit.
[2026-05-24 03:54:48] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:54:48] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/72 places, 76/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 56/72 places, 76/91 transitions.
[2026-05-24 03:54:48] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:48] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-24 03:54:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12896905151876733144.gal : 0 ms
[2026-05-24 03:54:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1792591241206097073.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12896905151876733144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1792591241206097073.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11821e+07,0.212105,13204,2,3752,5,51105,6,0,292,41718,0
Converting to forward existential form...Done !
original formula: EF((E(((p36==1)&&(p71==1)) U (p63==1)) * AX(A((p14==1) U ((p62==1)&&(p71==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(((p36==1)&&(p71==1)) U (p63==1))) * !(EX(!(!((E(!(((p62==1)&&(p71==1))) U (!((p14==1)) * ...226
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t25, t27, t29, t60, t63, t68, t69, t70, t71, t72, t73, t74, t75, Intersection...240
(forward)formula 0,1,6.15988,205496,1,0,472,1.04312e+06,184,255,1728,1.55243e+06,567
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 68 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 64 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 64 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 61 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 61 transition count 80
Applied a total of 22 rules in 10 ms. Remains 61 /72 variables (removed 11) and now considering 80/91 (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-16900106516500317892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3029084396167661532.kers'
[2026-05-24 03:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16900106516500317892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3029084396167661532.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 80 rows 59 cols 156 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-24 03:54:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3029084396167661532.kers
Total runtime 3 ms.
[2026-05-24 03:54:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 03:54:54] [INFO ] Invariant cache hit.
[2026-05-24 03:54:54] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 03:54:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-24 03:54:54] [INFO ] Invariant cache hit.
[2026-05-24 03:54:54] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 80/141 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 80/141 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 79/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 194 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3203ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3204ms
Starting structural reductions in LTL mode, iteration 1 : 61/72 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3297 ms. Remains : 61/72 places, 80/91 transitions.
[2026-05-24 03:54:57] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:54:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:54:57] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-24 03:54:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:54:57] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:54:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5483222970289331208.gal : 1 ms
[2026-05-24 03:54:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17574854955153544850.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5483222970289331208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17574854955153544850.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33352e+07,0.077801,7660,2,696,5,22695,6,0,312,14688,0
Converting to forward existential form...Done !
original formula: EF((((EF(AG((p0==0))) * !(A(EX((p6==1)) U (((p29==1)&&(p71==1))&&(p61==1))))) * ((((p44==0)||(p72==0))||(((p11==1)&&(p63==1))&&(p72==1)))...413
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((E(TRUE U !(E(TRUE U !((p0==0))))) * !(!((E(!((((p29==1)&&(p71==1))&&(p61==1))) U (!(EX...1751
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t24, t28, t30, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, Intersection with...235
(forward)formula 0,1,3.41059,120452,1,0,836,666365,213,448,1939,860729,1035
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 62 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 62 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 57 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 57 transition count 76
Applied a total of 30 rules in 2 ms. Remains 57 /72 variables (removed 15) and now considering 76/91 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12084707196580853428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13991181195257041628.kers'
[2026-05-24 03:55:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12084707196580853428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13991181195257041628.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 76 rows 55 cols 150 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-24 03:55:01] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13991181195257041628.kers
Total runtime 1 ms.
[2026-05-24 03:55:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 03:55:01] [INFO ] Invariant cache hit.
[2026-05-24 03:55:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:55:01] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-24 03:55:01] [INFO ] Invariant cache hit.
[2026-05-24 03:55:01] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 51/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 110 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 51/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 75/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 185 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3168ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3168ms
Starting structural reductions in LTL mode, iteration 1 : 57/72 places, 76/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3269 ms. Remains : 57/72 places, 76/91 transitions.
[2026-05-24 03:55:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:55:04] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-24 03:55:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16057470562998694438.gal : 0 ms
[2026-05-24 03:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16867673287817541529.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16057470562998694438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16867673287817541529.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11821e+07,0.090364,8076,2,935,5,25102,6,0,294,16116,0
Converting to forward existential form...Done !
original formula: EG(((EX((((p69==0)||(p71==0))||((p25==0)||(p71==0)))) * AG(!(A(((p44==1)&&(p72==1)) U (p68==1))))) * (((p2==0)||(p71==0))&&((p60==0)||(p7...164
=> equivalent forward existential formula: [FwdG(Init,((EX((((p69==0)||(p71==0))||((p25==0)||(p71==0)))) * !(E(TRUE U !(!(!((E(!((p68==1)) U (!(((p44==1)&&...264
Reverse transition relation is NOT exact ! Due to transitions t18, t20, t22, t25, t27, t29, t62, t64, t68, t69, t70, t71, t72, t73, t74, t75, Intersection...240
(forward)formula 0,0,1.85148,72980,1,0,437,408936,190,238,1830,499850,534
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 85
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 60 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 56 transition count 75
Applied a total of 32 rules in 8 ms. Remains 56 /72 variables (removed 16) and now considering 75/91 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1760192817318962782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8547399141399348870.kers'
[2026-05-24 03:55:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1760192817318962782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8547399141399348870.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 75 rows 54 cols 148 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:55:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8547399141399348870.kers
Total runtime 13 ms.
[2026-05-24 03:55:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 03:55:06] [INFO ] Invariant cache hit.
[2026-05-24 03:55:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:55:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-24 03:55:06] [INFO ] Invariant cache hit.
[2026-05-24 03:55:06] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 108 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 182 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2987ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2987ms
Starting structural reductions in LTL mode, iteration 1 : 56/72 places, 75/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3100 ms. Remains : 56/72 places, 75/91 transitions.
[2026-05-24 03:55:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:55:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:09] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-24 03:55:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:09] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10227387104794725619.gal : 0 ms
[2026-05-24 03:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9265955494524931628.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10227387104794725619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9265955494524931628.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05943e+07,0.143056,10524,2,1657,5,40635,6,0,289,25511,0
Converting to forward existential form...Done !
original formula: !(A(EF(EX(!(EG(((p8==1)&&(p72==1)))))) U EF(((EF((((p63==1)&&(p27==1))&&(p71==1))) * (p59==1)) * (p71==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U ((E(TRUE U (((p63==1)&&(p27==1))&&(p71==1))) * (p59==1)) * (p71==1))))) * !(E(TRUE U EX...388
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t20, t22, t23, t25, t27, t29, t67, t68, t69, t70, t71, t72, t73, t74, Intersection ...239
(forward)formula 0,0,1.19982,46848,1,0,226,238294,188,125,1792,248526,308
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 64 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 64 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 62 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 62 transition count 81
Applied a total of 20 rules in 6 ms. Remains 62 /72 variables (removed 10) and now considering 81/91 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4698018050738551546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8654293176859064356.kers'
[2026-05-24 03:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4698018050738551546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8654293176859064356.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 81 rows 60 cols 159 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 03:55:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8654293176859064356.kers
Total runtime 0 ms.
[2026-05-24 03:55:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:55:10] [INFO ] Invariant cache hit.
[2026-05-24 03:55:10] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 03:55:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-24 03:55:10] [INFO ] Invariant cache hit.
[2026-05-24 03:55:10] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/143 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 117 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/143 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 80/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 197 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3469ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3469ms
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3577 ms. Remains : 62/72 places, 81/91 transitions.
[2026-05-24 03:55:14] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:55:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:55:14] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-24 03:55:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:55:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1562635691105976819.gal : 0 ms
[2026-05-24 03:55:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14628014684999874264.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1562635691105976819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628014684999874264.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44531e+07,0.102501,7972,2,1002,5,23896,6,0,318,15480,0
Converting to forward existential form...Done !
original formula: AX(((p11==1) * (!(E(((((p47==1)&&(p71==1))||((p7==1)&&(p71==1))) * EX(((p42==1)&&(p71==1)))) U (E(((p45==1)&&(p71==1)) U ((p14==1)&&(p72=...236
=> equivalent forward existential formula: ([(EY(Init) * !((p11==1)))] = FALSE * ([(FwdU(FwdU((EY(Init) * !(EG(!(E((p46==1) U ((p62==1)&&(p71==1))))))),(((...459
Reverse transition relation is NOT exact ! Due to transitions t24, t25, t29, t31, t62, t64, t66, t72, t73, t74, t75, t76, t77, t78, t79, t80, Intersection...240
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.22949,82108,1,0,496,424907,207,319,1961,601963,528
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 03:55:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:55:16] [INFO ] Flatten gal took : 3 ms
Total runtime 80760 ms.
BK_STOP 1779594916802
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-07a"
export BK_EXAMINATION="CTLFireability"
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-07a, examination is CTLFireability"
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-177955695400250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;
