About the Execution of ITS-Tools for AutoFlight-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1510.636 | 379063.00 | 450901.00 | 152.30 | FFFFFFFTTFTTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300450.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300450
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.1K Mar 5 16:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 5 16:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 16:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 16:32 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 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:12 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 26K 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 AutoFlight-PT-01b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-12
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-13
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-14
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779490366361
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 22:52:47] [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-22 22:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:52:48] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-22 22:52:48] [INFO ] Transformed 114 places.
[2026-05-22 22:52:48] [INFO ] Transformed 112 transitions.
[2026-05-22 22:52:48] [INFO ] Found NUPN structural information;
[2026-05-22 22:52:48] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 87 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 110
Applied a total of 4 rules in 15 ms. Remains 112 /114 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11759031067775136606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14105189040477406650.kers'
[2026-05-22 22:52:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11759031067775136606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14105189040477406650.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 112 cols 260 entries
Finished phase 1 with 99 SingleSign rule and 3 generalized
[2026-05-22 22:52:48] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14105189040477406650.kers
Total runtime 1 ms.
[2026-05-22 22:52:48] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-22 22:52:48] [INFO ] Invariant cache hit.
[2026-05-22 22:52:48] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-22 22:52:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 110/222 variables, 112/143 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 144 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7627 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/222 variables, 112/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 109/253 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 264 constraints, problems are : Problem set: 0 solved, 109 unsolved in 21217 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 28885ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 28905ms
Starting structural reductions in LTL mode, iteration 1 : 112/114 places, 110/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29461 ms. Remains : 112/114 places, 110/112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-22 22:53:17] [INFO ] Invariant cache hit.
[2026-05-22 22:53:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 22:53:17] [INFO ] Invariant cache hit.
[2026-05-22 22:53:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 112/112 places, 110/110 transitions.
Support contains 87 out of 112 places after structural reductions.
[2026-05-22 22:53:17] [INFO ] Flatten gal took : 32 ms
[2026-05-22 22:53:17] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:53:17] [INFO ] Input system was already deterministic with 110 transitions.
RANDOM walk for 40000 steps (593 resets) in 1381 ms. (28 steps per ms) remains 9/81 properties
BEST_FIRST walk for 40004 steps (96 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (109 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (112 resets) in 120 ms. (330 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (112 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (111 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (106 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (107 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (102 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
[2026-05-22 22:53:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/112 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 110/222 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 122 constraints, problems are : Problem set: 0 solved, 8 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/109 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/112 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 110/222 variables, 112/124 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 7/131 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 133 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1247ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 5851 steps, including 78 resets, run visited all 1 properties in 9 ms. (steps per millisecond=650 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 43 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-01b-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:53:20] [INFO ] Input system was already deterministic with 110 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 111 transition count 74
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 77 place count 76 transition count 67
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 74 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 73 transition count 66
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 81 place count 73 transition count 48
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 117 place count 55 transition count 48
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 126 place count 46 transition count 39
Iterating global reduction 4 with 9 rules applied. Total rules applied 135 place count 46 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 135 place count 46 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 44 transition count 37
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 161 place count 33 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 32 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 31 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 163 place count 31 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 30 transition count 24
Applied a total of 165 rules in 34 ms. Remains 30 /112 variables (removed 82) and now considering 24/110 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12523908862672477330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12743177264457334918.kers'
[2026-05-22 22:53:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12523908862672477330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12743177264457334918.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 24 rows 27 cols 69 entries
Finished phase 1 with 18 SingleSign rule and 3 generalized
[2026-05-22 22:53:20] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12743177264457334918.kers
Total runtime 0 ms.
[2026-05-22 22:53:20] [INFO ] Implicit Places using invariants in 35 ms returned [12, 17, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/112 places, 24/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 22
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 24 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 24 transition count 21
Applied a total of 6 rules in 2 ms. Remains 24 /27 variables (removed 3) and now considering 21/24 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5876250589690630615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11839209842703509719.kers'
[2026-05-22 22:53:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5876250589690630615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11839209842703509719.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 21 cols 53 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 22:53:20] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11839209842703509719.kers
Total runtime 3 ms.
[2026-05-22 22:53:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-22 22:53:20] [INFO ] Invariant cache hit.
[2026-05-22 22:53:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:53:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/112 places, 21/110 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 137 ms. Remains : 24/112 places, 21/110 transitions.
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:53:20] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:53:20] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:53:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11763589934024487533.gal : 1 ms
[2026-05-22 22:53:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16147814826682659646.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/CTLFireability11763589934024487533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16147814826682659646.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,816,0.024544,3932,2,60,5,634,6,0,117,602,0
Converting to forward existential form...Done !
original formula: AF(AG((((p113==1)||(p30==0))||(p41==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p113==1)||(p30==0))||(p41==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.048727,5296,1,0,107,7376,68,75,686,9873,111
FORMULA AutoFlight-PT-01b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 98
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 95 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 95 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 94 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 94 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 93 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 93 transition count 91
Applied a total of 38 rules in 13 ms. Remains 93 /112 variables (removed 19) and now considering 91/110 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16313769311265759746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-434198556056515922.kers'
[2026-05-22 22:53:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16313769311265759746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-434198556056515922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 93 cols 222 entries
Finished phase 1 with 80 SingleSign rule and 3 generalized
[2026-05-22 22:53:20] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-434198556056515922.kers
Total runtime 0 ms.
[2026-05-22 22:53:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 22:53:20] [INFO ] Invariant cache hit.
[2026-05-22 22:53:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-22 22:53:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/184 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 113 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4600 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 91/184 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 90/206 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 17774ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17775ms
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 91/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17921 ms. Remains : 93/112 places, 91/110 transitions.
[2026-05-22 22:53:38] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:53:38] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:53:38] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-22 22:53:38] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:53:38] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:53:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8337123215692953691.gal : 2 ms
[2026-05-22 22:53:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9823717710503008419.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/CTLFireability8337123215692953691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9823717710503008419.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,2.22838e+07,0.035746,5644,2,1537,5,6977,6,0,465,6741,0
Converting to forward existential form...Done !
original formula: A((p99==1) U (E(!(((p0==1)||((p9==1)&&(p20==1)))) U AF(AX((p60==1)))) + ((p41==1)&&(p86==1))))
=> equivalent forward existential formula: [((Init * !(EG(!((E(!(((p0==1)||((p9==1)&&(p20==1)))) U !(EG(!(!(EX(!((p60==1)))))))) + ((p41==1)&&(p86==1))))))...385
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t48, t51, t55, t58, t66, t86, t87, Intersection wi...237
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,9.87763,335980,1,0,774,2.01381e+06,218,454,2658,2.12991e+06,880
FORMULA AutoFlight-PT-01b-CTLFireability-2024-01 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 : 112/112 places, 110/110 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 101 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 96 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 94 transition count 90
Applied a total of 38 rules in 61 ms. Remains 94 /112 variables (removed 18) and now considering 90/110 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4649786534052310300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2949723849723554915.kers'
[2026-05-22 22:53:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4649786534052310300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2949723849723554915.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 94 cols 220 entries
Finished phase 1 with 81 SingleSign rule and 3 generalized
[2026-05-22 22:53:48] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2949723849723554915.kers
Total runtime 0 ms.
[2026-05-22 22:53:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 22:53:48] [INFO ] Invariant cache hit.
[2026-05-22 22:53:48] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2026-05-22 22:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/184 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 118 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/184 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 89/209 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 89 unsolved in 8581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 14090ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 14095ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 90/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14304 ms. Remains : 94/112 places, 90/110 transitions.
[2026-05-22 22:54:02] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:54:02] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:54:02] [INFO ] Input system was already deterministic with 90 transitions.
[2026-05-22 22:54:02] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:54:02] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:54:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6168766884288977404.gal : 1 ms
[2026-05-22 22:54:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15893813136324621465.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/CTLFireability6168766884288977404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15893813136324621465.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.85613e+07,0.060815,7072,2,2506,5,11996,6,0,468,15722,0
Converting to forward existential form...Done !
original formula: A((EG(!(((EG(((p15==1)&&(p97==1))) + AF((p55==1))) + A(((p84==1)&&(p112==1)) U (p57==1))))) + E((!(E((p15==1) U (p72==1))) + ((AF(((p76==...335
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((p50==1)))))))) * !(E(!(!(EX(!((p50==1))))) U (!((EG(!(((EG(((p15==1)&&(p97==1))) + !(EG...574
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t11, t20, t23, t25, t33, t37, t39, t41, t51, t54, t58, t59, t67, t84, t85, t8...256
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-22 22:54:32] [INFO ] Flatten gal took : 17 ms
[2026-05-22 22:54:32] [INFO ] Applying decomposition
[2026-05-22 22:54:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4112649149992989546.txt' '-o' '/tmp/graph4112649149992989546.bin' '-w' '/tmp/graph4112649149992989546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4112649149992989546.bin' '-l' '-1' '-v' '-w' '/tmp/graph4112649149992989546.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:54:32] [INFO ] Decomposing Gal with order
[2026-05-22 22:54:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:54:32] [INFO ] Removed a total of 19 redundant transitions.
[2026-05-22 22:54:32] [INFO ] Flatten gal took : 66 ms
[2026-05-22 22:54:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-22 22:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12166836654308738788.gal : 3 ms
[2026-05-22 22:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10525253954471160841.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/CTLFireability12166836654308738788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10525253954471160841.ctl'
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 -...264
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.85613e+07,0.034068,5304,390,20,2685,177,259,2992,36,332,0
Converting to forward existential form...Done !
original formula: A((EG(!(((EG(((i1.u3.p15==1)&&(i10.u31.p97==1))) + AF((i4.u15.p55==1))) + A(((i9.u27.p84==1)&&(i6.i1.u39.p112==1)) U (i4.u13.p57==1))))) ...498
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((i4.u13.p50==1)))))))) * !(E(!(!(EX(!((i4.u13.p50==1))))) U (!((EG(!(((EG(((i1.u3.p15==1...777
Reverse transition relation is NOT exact ! Due to transitions t37, t58, t84, t85, t86, i1.u5.t0, i1.u5.t67, i2.t1, i2.u6.t59, i3.t54, i3.u9.t51, i4.u13.t4,...340
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,9.28094,300104,1,0,685480,179,1776,888300,183,470,837273
FORMULA AutoFlight-PT-01b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 111 transition count 79
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 81 transition count 73
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 78 transition count 72
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 70 place count 78 transition count 56
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 102 place count 62 transition count 56
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 54 transition count 48
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 54 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 118 place count 54 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 53 transition count 47
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 140 place count 43 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 42 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 41 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 142 place count 41 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 40 transition count 35
Applied a total of 144 rules in 28 ms. Remains 40 /112 variables (removed 72) and now considering 35/110 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14382742045783151536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9204454146117971984.kers'
[2026-05-22 22:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14382742045783151536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9204454146117971984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 35 rows 40 cols 96 entries
Finished phase 1 with 28 SingleSign rule and 3 generalized
[2026-05-22 22:54:42] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9204454146117971984.kers
Total runtime 0 ms.
[2026-05-22 22:54:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-22 22:54:42] [INFO ] Invariant cache hit.
[2026-05-22 22:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:54:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2026-05-22 22:54:42] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-22 22:54:42] [INFO ] Invariant cache hit.
[2026-05-22 22:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 4/40 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 35/75 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 56 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 4/40 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 35/75 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 86 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2212ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 2213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/112 places, 35/110 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2357 ms. Remains : 40/112 places, 35/110 transitions.
[2026-05-22 22:54:44] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:54:44] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:54:44] [INFO ] Input system was already deterministic with 35 transitions.
[2026-05-22 22:54:44] [INFO ] Flatten gal took : 10 ms
[2026-05-22 22:54:44] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16687760091182153554.gal : 1 ms
[2026-05-22 22:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8089428288869141271.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/CTLFireability16687760091182153554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8089428288869141271.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,15528,0.024538,4248,2,367,5,1621,6,0,196,1262,0
Converting to forward existential form...Done !
original formula: AF(AG((((p15==1)||(p55==1)) + ((((EF((p50==1)) + (p33==1)) * (((p15==1)||((p95==1)&&(p112==1)))||((p32==1)&&(p89==1)))) * (((p32==1)&&(p8...238
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p15==1)||(p55==1)) + ((((E(TRUE U (p50==1)) + (p33==1)) * (((p15==1)||((p95==1)&&(p...301
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t10, t31, t33, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,0.242988,13424,1,0,214,49417,102,118,1182,61825,197
FORMULA AutoFlight-PT-01b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 98
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 100 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 96 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 95 transition count 91
Applied a total of 36 rules in 5 ms. Remains 95 /112 variables (removed 17) and now considering 91/110 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7178925578865047819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15393116627152433681.kers'
[2026-05-22 22:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7178925578865047819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15393116627152433681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 95 cols 222 entries
Finished phase 1 with 82 SingleSign rule and 3 generalized
[2026-05-22 22:54:44] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15393116627152433681.kers
Total runtime 0 ms.
[2026-05-22 22:54:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-22 22:54:44] [INFO ] Invariant cache hit.
[2026-05-22 22:54:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-22 22:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 91/186 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 118 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 13/13 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/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 91/186 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 90/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 220 constraints, problems are : Problem set: 0 solved, 90 unsolved in 16008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 21491ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 21491ms
Starting structural reductions in LTL mode, iteration 1 : 95/112 places, 91/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21629 ms. Remains : 95/112 places, 91/110 transitions.
[2026-05-22 22:55:06] [INFO ] Flatten gal took : 10 ms
[2026-05-22 22:55:06] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:55:06] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-22 22:55:06] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:55:06] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:55:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13010085030923202673.gal : 1 ms
[2026-05-22 22:55:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4737546517446767149.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/CTLFireability13010085030923202673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4737546517446767149.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.92275e+07,0.096715,7752,2,2219,5,14931,6,0,473,19559,0
Converting to forward existential form...Done !
original formula: AG(EF((E(E((p109==1) U (p37==1)) U AX((p77==1))) * (p35==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(E((p109==1) U (p37==1)) U !(EX(!((p77==1))))) * (p35==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t10, t18, t23, t32, t35, t36, t38, t39, t50, t52, t55, t59, t62, t68, t86, t8...256
(forward)formula 0,0,1.90724,74700,1,0,462,371288,211,238,2491,465454,487
FORMULA AutoFlight-PT-01b-CTLFireability-2024-04 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 : 112/112 places, 110/110 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 101 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 99 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 99 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 98 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 98 transition count 95
Applied a total of 29 rules in 5 ms. Remains 98 /112 variables (removed 14) and now considering 95/110 (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-17466745717304059734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16474972792574548290.kers'
[2026-05-22 22:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17466745717304059734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16474972792574548290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 98 cols 230 entries
Finished phase 1 with 85 SingleSign rule and 3 generalized
[2026-05-22 22:55:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16474972792574548290.kers
Total runtime 1 ms.
[2026-05-22 22:55:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 22:55:08] [INFO ] Invariant cache hit.
[2026-05-22 22:55:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-22 22:55:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/193 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 115 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/193 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 94/211 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 17 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 94 unsolved in 18424 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 22711ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 22712ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 95/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22840 ms. Remains : 98/112 places, 95/110 transitions.
[2026-05-22 22:55:31] [INFO ] Flatten gal took : 10 ms
[2026-05-22 22:55:31] [INFO ] Flatten gal took : 7 ms
[2026-05-22 22:55:31] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-22 22:55:31] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:55:31] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:55:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3884446677782508953.gal : 2 ms
[2026-05-22 22:55:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12354258292609708417.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/CTLFireability3884446677782508953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12354258292609708417.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,2.68983e+07,0.12175,7760,2,2686,5,14938,6,0,489,19552,0
Converting to forward existential form...Done !
original formula: AG((AF((((EX(((p22==1)&&(p90==1))) + AF((p14==1))) * (AX((p3==1)) + EG(((p38==1)&&(p74==1))))) * A((p25==1) U (p72==1)))) + ((AX(A((p23==...322
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(!(EG(!((((EX(((p22==1)&&(p90==1))) + !(EG(!((p14==1))))) * (!(EX(!((p3==1)))) + EG(((p...1045
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t10, t18, t23, t31, t35, t37, t38, t51, t53, t56, t60, t62, t64, t69, t72, t89, t90, ...258
(forward)formula 0,0,24.3356,612696,1,0,1880,3.55363e+06,246,875,2796,4.46054e+06,2157
FORMULA AutoFlight-PT-01b-CTLFireability-2024-05 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 : 112/112 places, 110/110 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 105 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 104 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 104 transition count 101
Applied a total of 17 rules in 11 ms. Remains 104 /112 variables (removed 8) and now considering 101/110 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4998007063828938182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17231910901843898082.kers'
[2026-05-22 22:55:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4998007063828938182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17231910901843898082.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 104 cols 242 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-22 22:55:55] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17231910901843898082.kers
Total runtime 1 ms.
[2026-05-22 22:55:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-22 22:55:56] [INFO ] Invariant cache hit.
[2026-05-22 22:55:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-22 22:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 101/205 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 128 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6195 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 101/205 variables, 104/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 100/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 0/205 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/205 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 242 constraints, problems are : Problem set: 0 solved, 100 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 36218ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 36219ms
Starting structural reductions in LTL mode, iteration 1 : 104/112 places, 101/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36456 ms. Remains : 104/112 places, 101/110 transitions.
[2026-05-22 22:56:32] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:56:32] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:56:32] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-22 22:56:32] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:56:32] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14343821898000178312.gal : 1 ms
[2026-05-22 22:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6887354579923378016.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/CTLFireability14343821898000178312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6887354579923378016.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,3.48644e+07,0.160574,11732,2,4322,5,28844,6,0,519,44797,0
Converting to forward existential form...Done !
original formula: ((AX(((AF(E((p29==1) U (p29==1))) * (A((p44==1) U ((p38==1)&&(p74==1))) + (p26==1))) * (AX(((p84==1)&&(p112==1))) * (p0==1)))) + EX((AX(E...551
=> equivalent forward existential formula: ([((Init * !((!(EX(!(((!(EG(!(E((p29==1) U (p29==1))))) * (!((E(!(((p38==1)&&(p74==1))) U (!((p44==1)) * !(((p38...2362
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t12, t21, t24, t26, t35, t38, t39, t41, t42, t57, t59, t66, t68, t73,...275
(forward)formula 0,0,4.70219,149772,1,0,463,709356,261,252,3039,1.046e+06,500
FORMULA AutoFlight-PT-01b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 111 transition count 71
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 83 place count 73 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 71 transition count 64
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 85 place count 71 transition count 47
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 119 place count 54 transition count 47
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 129 place count 44 transition count 37
Iterating global reduction 3 with 10 rules applied. Total rules applied 139 place count 44 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 139 place count 44 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 41 transition count 34
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 165 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 167 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 28 transition count 22
Applied a total of 169 rules in 27 ms. Remains 28 /112 variables (removed 84) and now considering 22/110 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8948486731723424396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12735024614804008765.kers'
[2026-05-22 22:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8948486731723424396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12735024614804008765.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 22 rows 25 cols 61 entries
Finished phase 1 with 16 SingleSign rule and 3 generalized
[2026-05-22 22:56:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12735024614804008765.kers
Total runtime 0 ms.
[2026-05-22 22:56:37] [INFO ] Implicit Places using invariants in 47 ms returned [9, 14, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/112 places, 22/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 23 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 20
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 20/22 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13042820692938929577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8193989685198500048.kers'
[2026-05-22 22:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13042820692938929577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8193989685198500048.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 20 cols 50 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-22 22:56:37] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8193989685198500048.kers
Total runtime 0 ms.
[2026-05-22 22:56:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 22:56:37] [INFO ] Invariant cache hit.
[2026-05-22 22:56:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:56:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/112 places, 20/110 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 262 ms. Remains : 23/112 places, 20/110 transitions.
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18176253325873238132.gal : 0 ms
[2026-05-22 22:56:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6345643971181992215.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18176253325873238132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6345643971181992215.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6345643971181992215.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
RANDOM walk for 4475 steps (476 resets) in 67 ms. (65 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-01b-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 72
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :72 after 120
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,456,0.018276,4120,2,64,9,440,7,0,116,311,0
Total reachable state count : 456
Verifying 1 reachability properties.
Reachability property AutoFlight-PT-01b-CTLFireability-2024-07 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-01b-CTLFireability-2024-07,12,0.018642,4336,2,32,9,440,7,0,119,311,0
ITS runner timed out or was interrupted.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 111 transition count 78
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 38 rules applied. Total rules applied 69 place count 80 transition count 71
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 76 place count 76 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 75 transition count 68
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 77 place count 75 transition count 52
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 109 place count 59 transition count 52
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 118 place count 50 transition count 43
Iterating global reduction 4 with 9 rules applied. Total rules applied 127 place count 50 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 127 place count 50 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 47 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 153 place count 37 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 36 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 35 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 155 place count 35 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 34 transition count 28
Applied a total of 157 rules in 10 ms. Remains 34 /112 variables (removed 78) and now considering 28/110 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-127597693037266046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10344083842058335610.kers'
[2026-05-22 22:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-127597693037266046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10344083842058335610.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 28 rows 33 cols 79 entries
Finished phase 1 with 22 SingleSign rule and 3 generalized
[2026-05-22 22:56:37] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10344083842058335610.kers
Total runtime 2 ms.
[2026-05-22 22:56:37] [INFO ] Implicit Places using invariants in 48 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/112 places, 28/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62 ms. Remains : 33/112 places, 28/110 transitions.
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 0 ms
[2026-05-22 22:56:37] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Flatten gal took : 1 ms
[2026-05-22 22:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9301102741860198649.gal : 0 ms
[2026-05-22 22:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3592527579091524323.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/CTLFireability9301102741860198649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3592527579091524323.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,6102,0.007393,4112,2,174,5,1094,6,0,162,857,0
Converting to forward existential form...Done !
original formula: EG((AF(((!(E((p80==1) U (p56==1))) + (p14==0)) * EF((p82==1)))) + EG(((p95==1)&&(p112==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((!(E((p80==1) U (p56==1))) + (p14==0)) * E(TRUE U (p82==1)))))) + EG(((p95==1)&&(p112==1))))...166
Reverse transition relation is NOT exact ! Due to transitions t8, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.229919,15460,1,0,362,70082,100,234,1019,75872,403
FORMULA AutoFlight-PT-01b-CTLFireability-2024-08 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 : 112/112 places, 110/110 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 98 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 98 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 93 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 92 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 91 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 91 transition count 87
Applied a total of 44 rules in 8 ms. Remains 91 /112 variables (removed 21) and now considering 87/110 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7348114471485677070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1283258008425236037.kers'
[2026-05-22 22:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7348114471485677070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1283258008425236037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 91 cols 214 entries
Finished phase 1 with 78 SingleSign rule and 3 generalized
[2026-05-22 22:56:37] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1283258008425236037.kers
Total runtime 0 ms.
[2026-05-22 22:56:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 22:56:37] [INFO ] Invariant cache hit.
[2026-05-22 22:56:38] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-22 22:56:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/178 variables, 91/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 107 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3738 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/178 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 86/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 202 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9971 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 13729ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13729ms
Starting structural reductions in LTL mode, iteration 1 : 91/112 places, 87/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13953 ms. Remains : 91/112 places, 87/110 transitions.
[2026-05-22 22:56:51] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:56:51] [INFO ] Flatten gal took : 7 ms
[2026-05-22 22:56:51] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-22 22:56:51] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:56:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability767734948750878666.gal : 0 ms
[2026-05-22 22:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15128091823339977513.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/CTLFireability767734948750878666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15128091823339977513.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.67448e+07,0.053256,5600,2,1520,5,6911,6,0,453,6687,0
Converting to forward existential form...Done !
original formula: EX(AG((p99==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p99==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t48, t51, t55, t58, t64, t82, t83, Intersection wi...237
(forward)formula 0,0,0.769181,31460,1,0,190,136055,196,103,2521,132448,223
FORMULA AutoFlight-PT-01b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 98 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 98 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 93 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 92 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 91 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 91 transition count 87
Applied a total of 44 rules in 12 ms. Remains 91 /112 variables (removed 21) and now considering 87/110 (removed 23) transitions.
[2026-05-22 22:56:52] [INFO ] Invariant cache hit.
[2026-05-22 22:56:52] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-22 22:56:52] [INFO ] Invariant cache hit.
[2026-05-22 22:56:52] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 91/112 places, 87/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 91/112 places, 87/110 transitions.
[2026-05-22 22:56:52] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:56:52] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:56:52] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-22 22:56:52] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:56:52] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:56:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8434511534433908399.gal : 0 ms
[2026-05-22 22:56:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1251141730827445990.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/CTLFireability8434511534433908399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1251141730827445990.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.67448e+07,0.033839,5596,2,1520,5,6911,6,0,453,6687,0
Converting to forward existential form...Done !
original formula: EG(((p57==0) * EG(EX((p71==0)))))
=> equivalent forward existential formula: [FwdG(Init,((p57==0) * EG(EX((p71==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t48, t51, t55, t58, t64, t82, t83, Intersection wi...237
Using saturation style SCC detection
(forward)formula 0,1,6.21592,220332,1,0,641,1.30266e+06,203,393,2577,1.28419e+06,660
FORMULA AutoFlight-PT-01b-CTLFireability-2024-11 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 : 112/112 places, 110/110 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 99 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 99 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 95 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 93 transition count 89
Applied a total of 40 rules in 4 ms. Remains 93 /112 variables (removed 19) and now considering 89/110 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16736541906432091126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-820311046433275235.kers'
[2026-05-22 22:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16736541906432091126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-820311046433275235.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 93 cols 218 entries
Finished phase 1 with 80 SingleSign rule and 3 generalized
[2026-05-22 22:56:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-820311046433275235.kers
Total runtime 0 ms.
[2026-05-22 22:56:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 22:56:59] [INFO ] Invariant cache hit.
[2026-05-22 22:56:59] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-22 22:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/182 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 109 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4758 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 89/182 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 88/204 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (OVERLAPS) 0/182 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 18 (OVERLAPS) 0/182 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 210 constraints, problems are : Problem set: 0 solved, 88 unsolved in 17116 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 21900ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 21901ms
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 89/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22066 ms. Remains : 93/112 places, 89/110 transitions.
[2026-05-22 22:57:21] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:57:21] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:57:21] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-22 22:57:21] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:57:21] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13398485088934574665.gal : 0 ms
[2026-05-22 22:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9694740247266756847.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/CTLFireability13398485088934574665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9694740247266756847.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.94639e+07,0.080231,6460,2,2049,5,9805,6,0,463,12360,0
Converting to forward existential form...Done !
original formula: EF(AX((A((p13==1) U (((p81==1)&&(p2==1))||(p49==1))) + ((p11==1)&&(p75==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!((E(!((((p81==1)&&(p2==1))||(p49==1))) U (!((p13==1)) * !((((p81==1)&&(p2==1))||(p4...245
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t18, t23, t31, t35, t37, t38, t50, t53, t57, t60, t64, t83, t84, t85, Inter...247
(forward)formula 0,1,11.1212,279316,1,0,849,1.59469e+06,206,380,2527,2.04164e+06,951
FORMULA AutoFlight-PT-01b-CTLFireability-2024-12 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 : 112/112 places, 110/110 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 101 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 99 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 99 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 98 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 98 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 97 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 97 transition count 93
Applied a total of 32 rules in 7 ms. Remains 97 /112 variables (removed 15) and now considering 93/110 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9853414260993704156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3777384082247815925.kers'
[2026-05-22 22:57:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9853414260993704156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3777384082247815925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 97 cols 226 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-22 22:57:32] [INFO ] Computed 10 invariants in 9 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-3777384082247815925.kers
Total runtime 10 ms.
[2026-05-22 22:57:32] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 22:57:32] [INFO ] Invariant cache hit.
[2026-05-22 22:57:32] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-22 22:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 93/190 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 127 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5641 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/190 variables, 97/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 228 constraints, problems are : Problem set: 0 solved, 92 unsolved in 13408 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 19055ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 19055ms
Starting structural reductions in LTL mode, iteration 1 : 97/112 places, 93/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19260 ms. Remains : 97/112 places, 93/110 transitions.
[2026-05-22 22:57:51] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:57:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:57:51] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-22 22:57:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:57:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:57:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9414963319629684999.gal : 1 ms
[2026-05-22 22:57:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3678374767071162831.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/CTLFireability9414963319629684999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3678374767071162831.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,2.49246e+07,0.084694,8076,2,2906,5,16150,6,0,483,20986,0
Converting to forward existential form...Done !
original formula: AX((EF((EF((p53==1)) * (AX(((p91==1)&&(p110==1))) + E((p25==1) U (p109==1))))) + ((AF(((AG((p7==1)) + (p61==1)) + (p106==1))) * (p65==1))...294
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(E(TRUE U (E(TRUE U (p53==1)) * (!(EX(!(((p91==1)&&(p110==1))))) + E((p25==1) U (p109==1)))...1503
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t11, t19, t24, t32, t36, t38, t39, t56, t60, t63, t68, t70, t73, t87, t88, t8...256
(forward)formula 0,1,17.185,551820,1,0,1325,3.21415e+06,252,633,2764,3.98008e+06,1488
FORMULA AutoFlight-PT-01b-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 98
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 100 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 97 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 97 transition count 93
Applied a total of 32 rules in 12 ms. Remains 97 /112 variables (removed 15) and now considering 93/110 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-826860909065709803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14164597242998309897.kers'
[2026-05-22 22:58:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-826860909065709803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14164597242998309897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 97 cols 226 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-05-22 22:58:09] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14164597242998309897.kers
Total runtime 1 ms.
[2026-05-22 22:58:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-22 22:58:09] [INFO ] Invariant cache hit.
[2026-05-22 22:58:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 97/112 places, 93/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 97/112 places, 93/110 transitions.
[2026-05-22 22:58:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:58:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:58:09] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-22 22:58:09] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:58:09] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:58:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2441804928716188607.gal : 1 ms
[2026-05-22 22:58:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4791952155656685287.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/CTLFireability2441804928716188607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4791952155656685287.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,2.11199e+07,0.109585,9408,2,3648,5,20841,6,0,483,30329,0
Converting to forward existential form...Done !
original formula: (E(!(EG((E((p30==1) U (p65==1)) * AF(((p95==1)&&(p112==1)))))) U (EF(!((((((p41==1)&&(p86==1))&&(p111==1))||(p10==1))||(p88==1)))) * !((!...233
=> equivalent forward existential formula: [FwdG((Init * E(!(EG((E((p30==1) U (p65==1)) * !(EG(!(((p95==1)&&(p112==1)))))))) U (E(TRUE U !((((((p41==1)&&(p...337
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t11, t19, t24, t32, t36, t38, t39, t53, t56, t57, t60, t61, t64, t68, t87, t8...261
Using saturation style SCC detection
(forward)formula 0,1,25.9364,879148,1,0,2018,4.7777e+06,244,1040,2880,6.66251e+06,2188
FORMULA AutoFlight-PT-01b-CTLFireability-2024-14 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 : 112/112 places, 110/110 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 99 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 99 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 95 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 93 transition count 89
Applied a total of 40 rules in 18 ms. Remains 93 /112 variables (removed 19) and now considering 89/110 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16396143596786768810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8246147449295374590.kers'
[2026-05-22 22:58:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16396143596786768810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8246147449295374590.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 93 cols 218 entries
Finished phase 1 with 80 SingleSign rule and 3 generalized
[2026-05-22 22:58:35] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8246147449295374590.kers
Total runtime 2 ms.
[2026-05-22 22:58:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-22 22:58:35] [INFO ] Invariant cache hit.
[2026-05-22 22:58:35] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-22 22:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/182 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 118 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5813 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/182 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 88/205 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (OVERLAPS) 0/182 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 220 constraints, problems are : Problem set: 0 solved, 88 unsolved in 17324 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 23146ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 23146ms
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 89/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23357 ms. Remains : 93/112 places, 89/110 transitions.
[2026-05-22 22:58:58] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:58:58] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:58:58] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-22 22:58:58] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:58:58] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16638313423601255628.gal : 0 ms
[2026-05-22 22:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4172679854866090133.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/CTLFireability16638313423601255628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4172679854866090133.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.85773e+07,0.059099,6336,2,2233,5,9683,6,0,463,11192,0
Converting to forward existential form...Done !
original formula: EF(EX(AF(AG((p17==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(!(E(TRUE U !((p17==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t18, t23, t31, t35, t37, t38, t49, t52, t56, t59, t64, t66, t69, t83, t84, t85, ...253
(forward)formula 0,0,6.49402,157184,1,0,492,854454,203,220,2624,974005,534
FORMULA AutoFlight-PT-01b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:59:05] [INFO ] Flatten gal took : 2 ms
[2026-05-22 22:59:05] [INFO ] Flatten gal took : 1 ms
Total runtime 377530 ms.
BK_STOP 1779490745424
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="AutoFlight-PT-01b"
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 AutoFlight-PT-01b, 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 r002-oct2-177944366300450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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 ;