fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366400535
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutoFlight-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
538.020 34924.00 89522.00 117.50 TTTTFTFTTTTTTTTT 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-177944366400535.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-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.2K Mar 5 16:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 5 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 5 16:35 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:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 5 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 134K 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-06b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779493192279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 23:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 23:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:39:54] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2026-05-22 23:39:54] [INFO ] Transformed 574 places.
[2026-05-22 23:39:54] [INFO ] Transformed 572 transitions.
[2026-05-22 23:39:54] [INFO ] Found NUPN structural information;
[2026-05-22 23:39:54] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2026-05-22 23:39:54] [INFO ] Flatten gal took : 94 ms
[2026-05-22 23:39:54] [INFO ] Flatten gal took : 83 ms
[2026-05-22 23:39:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13368288077094780297.gal : 40 ms
[2026-05-22 23:39:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality986782836238242784.prop : 2 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/ReachabilityCardinality13368288077094780297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality986782836238242784.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 ...328
RANDOM walk for 40000 steps (137 resets) in 2181 ms. (18 steps per ms) remains 4/16 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality986782836238242784.prop.
BEST_FIRST walk for 40004 steps (12 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 8
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-05 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :8 after 17
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-13 is true.
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-07 is true.
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-03 is true.
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :17 after 26
Invariant property AutoFlight-PT-06b-ReachabilityFireability-2024-06 does not hold.
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :26 after 35
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :35 after 39
BEST_FIRST walk for 40004 steps (12 resets) in 587 ms. (68 steps per ms) remains 4/4 properties
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :39 after 81
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-08 is true.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :81 after 3187
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-11 is true.
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :3187 after 198991
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :198991 after 9.74927e+06
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :9.74927e+06 after 4.29942e+09
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :4.29942e+09 after 8.36155e+14
BEST_FIRST walk for 40004 steps (12 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-12 is true.
Reachability property AutoFlight-PT-06b-ReachabilityFireability-2024-10 is true.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :8.36155e+14 after 8.53228e+23
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :8.53228e+23 after 8.03157e+31
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9554033307518279156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10892540948060290434.kers'
[2026-05-22 23:39:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9554033307518279156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10892540948060290434.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 572 rows 574 cols 1334 entries
Finished phase 1 with 526 SingleSign rule and 8 generalized
[2026-05-22 23:39:55] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10892540948060290434.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 477/574 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 477/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 572/1146 variables, 574/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 1188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3387 ms.
Refiners :[Domain max(s): 574/574 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutoFlight-PT-06b-ReachabilityFireability-2024-09 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 477/574 variables, 39/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 477/613 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/614 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 20/634 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 8701ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 574 transition count 417
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 175 rules applied. Total rules applied 330 place count 419 transition count 397
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 25 rules applied. Total rules applied 355 place count 415 transition count 376
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 382 place count 394 transition count 370
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 382 place count 394 transition count 312
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 498 place count 336 transition count 312
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 540 place count 294 transition count 270
Iterating global reduction 4 with 42 rules applied. Total rules applied 582 place count 294 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 583 place count 294 transition count 269
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 583 place count 294 transition count 257
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 607 place count 282 transition count 257
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 701 place count 235 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 707 place count 232 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 710 place count 232 transition count 208
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 722 place count 232 transition count 196
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 734 place count 220 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 220 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 736 place count 219 transition count 194
Applied a total of 736 rules in 179 ms. Remains 219 /574 variables (removed 355) and now considering 194/572 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 219/574 places, 194/572 transitions.
RANDOM walk for 40000 steps (489 resets) in 468 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (42 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 988550 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 3
Probabilistic random walk after 988550 steps, saw 143859 distinct states, run finished after 3007 ms. (steps per millisecond=328 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17168016921041085468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13321902978922414026.kers'
[2026-05-22 23:40:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17168016921041085468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13321902978922414026.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 194 rows 215 cols 557 entries
Finished phase 1 with 171 SingleSign rule and 8 generalized
[2026-05-22 23:40:07] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13321902978922414026.kers
Total runtime 1 ms.
[2026-05-22 23:40:07] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/209 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/217 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/219 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 194/413 variables, 219/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 22/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 219/219 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/209 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/217 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/219 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 194/413 variables, 219/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/413 variables, 22/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/413 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutoFlight-PT-06b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/413 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/413 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/413 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/413 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/413 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 312 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4781 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 219/219 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5220ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 369 ms.
Support contains 47 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 219 transition count 185
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 210 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 207 transition count 182
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 24 place count 207 transition count 176
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 36 place count 201 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 200 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 200 transition count 175
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 70 place count 184 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 184 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 182 transition count 157
Applied a total of 74 rules in 21 ms. Remains 182 /219 variables (removed 37) and now considering 157/194 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 182/219 places, 157/194 transitions.
RANDOM walk for 40000 steps (704 resets) in 555 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (61 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (62 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1467785 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :0 out of 2
Probabilistic random walk after 1467785 steps, saw 211952 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5341611543234986396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17573454076852502875.kers'
[2026-05-22 23:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5341611543234986396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17573454076852502875.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 157 rows 173 cols 459 entries
Finished phase 1 with 134 SingleSign rule and 8 generalized
[2026-05-22 23:40:16] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17573454076852502875.kers
Total runtime 1 ms.
[2026-05-22 23:40:16] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/167 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/176 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/182 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 157/339 variables, 182/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 30/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 182/182 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/167 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/176 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/182 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 157/339 variables, 182/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 30/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/339 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3446 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 182/182 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3669ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 380 ms.
Support contains 47 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 157/157 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 182/182 places, 157/157 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2026-05-22 23:40:20] [INFO ] Invariant cache hit.
[2026-05-22 23:40:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 23:40:20] [INFO ] Invariant cache hit.
[2026-05-22 23:40:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-22 23:40:20] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 410 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 181/182 places, 157/157 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 181 transition count 153
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 177 transition count 153
Applied a total of 8 rules in 5 ms. Remains 177 /181 variables (removed 4) and now considering 153/157 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2515830135486360424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6625396612130057844.kers'
[2026-05-22 23:40:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2515830135486360424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6625396612130057844.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 153 rows 169 cols 451 entries
Finished phase 1 with 130 SingleSign rule and 8 generalized
[2026-05-22 23:40:20] [INFO ] Computed 39 invariants in 0 ms
Computed 39 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6625396612130057844.kers
Total runtime 1 ms.
[2026-05-22 23:40:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-22 23:40:20] [INFO ] Invariant cache hit.
[2026-05-22 23:40:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-22 23:40:21] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 177/182 places, 153/157 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 818 ms. Remains : 177/182 places, 153/157 transitions.
RANDOM walk for 40000 steps (702 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (57 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 82 ms. (481 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 23:40:21] [INFO ] Invariant cache hit.
[2026-05-22 23:40:21] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/146 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/172 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/177 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/330 variables, 177/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 26/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/146 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/172 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/177 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/330 variables, 177/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 26/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 30 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 177 transition count 145
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 169 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 144
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 168 transition count 139
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 163 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 161 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 161 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 37 place count 161 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 37 place count 161 transition count 131
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 39 place count 160 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 47 place count 156 transition count 127
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 52 place count 156 transition count 122
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 57 place count 151 transition count 122
Applied a total of 57 rules in 18 ms. Remains 151 /177 variables (removed 26) and now considering 122/153 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 151/177 places, 122/153 transitions.
RANDOM walk for 40000 steps (911 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (103 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1956351 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :0 out of 1
Probabilistic random walk after 1956351 steps, saw 303250 distinct states, run finished after 3001 ms. (steps per millisecond=651 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3718823876882286597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5392809812575764933.kers'
[2026-05-22 23:40:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3718823876882286597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5392809812575764933.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 122 rows 138 cols 349 entries
Finished phase 1 with 104 SingleSign rule and 8 generalized
[2026-05-22 23:40:25] [INFO ] Computed 39 invariants in 0 ms
Computed 39 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5392809812575764933.kers
Total runtime 8 ms.
[2026-05-22 23:40:25] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 102/132 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/142 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/151 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 122/273 variables, 151/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 35/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 102/132 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/142 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/151 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 122/273 variables, 151/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 35/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1397ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 33382 ms.

BK_STOP 1779493227203

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-06b"
export BK_EXAMINATION="ReachabilityFireability"
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-06b, examination is ReachabilityFireability"
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-177944366400535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;