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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3075.384 1911668.00 2098019.00 554.10 TFTTFFFTTFTFFFTT 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-177944366400519.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-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.2K Mar 5 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 16:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Mar 5 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 5 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 5 16:41 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 113K 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-05b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779492120645

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 23:22:01] [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:22:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:22:02] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-22 23:22:02] [INFO ] Transformed 482 places.
[2026-05-22 23:22:02] [INFO ] Transformed 480 transitions.
[2026-05-22 23:22:02] [INFO ] Found NUPN structural information;
[2026-05-22 23:22:02] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2026-05-22 23:22:02] [INFO ] Flatten gal took : 129 ms
[2026-05-22 23:22:02] [INFO ] Flatten gal took : 31 ms
RANDOM walk for 40000 steps (161 resets) in 1952 ms. (20 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 23:22:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5323127419836606024.gal : 25 ms
[2026-05-22 23:22:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4508910207901934705.prop : 5 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/ReachabilityCardinality5323127419836606024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4508910207901934705.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (14 resets) in 207 ms. (192 steps per ms) remains 9/9 properties

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
Loading property file /tmp/ReachabilityCardinality4508910207901934705.prop.
BEST_FIRST walk for 40004 steps (12 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 8
BEST_FIRST walk for 40004 steps (15 resets) in 380 ms. (104 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :34 after 476
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :476 after 198986
BEST_FIRST walk for 40004 steps (12 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (16 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 147 ms. (270 steps per ms) remains 8/9 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (13 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6920996954824736031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10084056751399230259.kers'
[2026-05-22 23:22:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6920996954824736031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10084056751399230259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 480 rows 482 cols 1120 entries
Finished phase 1 with 441 SingleSign rule and 7 generalized
[2026-05-22 23:22:03] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10084056751399230259.kers
Total runtime 3 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 347/482 variables, 33/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 347/515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2166 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 8/6 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/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutoFlight-PT-05b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-05b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 347/482 variables, 33/168 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 347/515 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/516 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :198986 after 3.86947e+10
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 20/536 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SMT process timed out in 7363ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 109 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 482 transition count 392
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 128 rules applied. Total rules applied 216 place count 394 transition count 352
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 258 place count 360 transition count 344
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 258 place count 360 transition count 298
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 350 place count 314 transition count 298
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 380 place count 284 transition count 268
Iterating global reduction 3 with 30 rules applied. Total rules applied 410 place count 284 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 413 place count 284 transition count 265
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 413 place count 284 transition count 259
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 425 place count 278 transition count 259
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 485 place count 248 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 487 place count 247 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 493 place count 247 transition count 223
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 505 place count 247 transition count 211
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 517 place count 235 transition count 211
Applied a total of 517 rules in 115 ms. Remains 235 /482 variables (removed 247) and now considering 211/480 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 235/482 places, 211/480 transitions.
RANDOM walk for 40000 steps (367 resets) in 384 ms. (103 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (42 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (40 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 105 ms. (377 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7013516532209029416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5423677301066848504.kers'
[2026-05-22 23:22:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7013516532209029416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5423677301066848504.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 235 cols 556 entries
Finished phase 1 with 194 SingleSign rule and 7 generalized
[2026-05-22 23:22:11] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5423677301066848504.kers
Total runtime 1 ms.
[2026-05-22 23:22:11] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 152/234 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/235 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 211/446 variables, 235/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 15/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 284 constraints, problems are : Problem set: 0 solved, 4 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 235/235 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/3 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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 152/234 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 211/446 variables, 235/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 15/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/446 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 320 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6815 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 235/235 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 7265ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 550 ms.
Support contains 82 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 211/211 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 235 transition count 206
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 230 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 227 transition count 203
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 227 transition count 196
Deduced a syphon composed of 7 places in 14 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 220 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 218 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 218 transition count 194
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 52 place count 209 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 54 place count 208 transition count 185
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 208 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 206 transition count 183
Applied a total of 58 rules in 74 ms. Remains 206 /235 variables (removed 29) and now considering 183/211 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 206/235 places, 183/211 transitions.
RANDOM walk for 40000 steps (439 resets) in 205 ms. (194 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (53 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (53 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2369430166095044151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9219629281815166318.kers'
[2026-05-22 23:22:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2369430166095044151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9219629281815166318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 206 cols 491 entries
Finished phase 1 with 165 SingleSign rule and 7 generalized
[2026-05-22 23:22:19] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9219629281815166318.kers
Total runtime 1 ms.
[2026-05-22 23:22:19] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/205 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/206 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 183/389 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 21/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 206/206 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/2 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/205 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 183/389 variables, 206/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 21/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/389 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 206/206 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3807ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 584 ms.
Support contains 81 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 183/183 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 205 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 205 transition count 182
Applied a total of 2 rules in 9 ms. Remains 205 /206 variables (removed 1) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 205/206 places, 182/183 transitions.
RANDOM walk for 40000 steps (442 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (54 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (54 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (54 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 910737 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 3
Probabilistic random walk after 910737 steps, saw 127978 distinct states, run finished after 3008 ms. (steps per millisecond=302 ) 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-7534588724418103194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13262151184041452501.kers'
[2026-05-22 23:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7534588724418103194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13262151184041452501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 205 cols 489 entries
Finished phase 1 with 164 SingleSign rule and 7 generalized
[2026-05-22 23:22:27] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13262151184041452501.kers
Total runtime 2 ms.
[2026-05-22 23:22:27] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/204 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/205 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 182/387 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 21/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 260 constraints, problems are : Problem set: 0 solved, 3 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/2 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/204 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/205 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 182/387 variables, 205/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 21/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2792 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3194ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 723 ms.
Support contains 81 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 205/205 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-22 23:22:31] [INFO ] Invariant cache hit.
[2026-05-22 23:22:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 23:22:31] [INFO ] Invariant cache hit.
[2026-05-22 23:22:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-22 23:22:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2026-05-22 23:22:31] [INFO ] Redundant transitions in 6 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-22 23:22:31] [INFO ] Invariant cache hit.
[2026-05-22 23:22:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/387 variables, 205/291 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 316 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 56/90 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 182/387 variables, 205/296 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 21/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 181/498 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 7/507 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 507 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60405 ms. Remains : 205/205 places, 182/182 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 332 edges and 205 vertex of which 200 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 200 transition count 176
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 194 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 192 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 17 place count 192 transition count 164
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 37 place count 182 transition count 164
Applied a total of 37 rules in 15 ms. Remains 182 /205 variables (removed 23) and now considering 164/182 (removed 18) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3870608754398692101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4325256130192575814.kers'
[2026-05-22 23:23:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3870608754398692101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4325256130192575814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 182 cols 448 entries
Finished phase 1 with 146 SingleSign rule and 7 generalized
[2026-05-22 23:23:31] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4325256130192575814.kers
Total runtime 2 ms.
[2026-05-22 23:23:31] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 23:23:31] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2026-05-22 23:23:31] [INFO ] [Nat]Absence check using 27 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-22 23:23:31] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 23:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-22 23:23:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
TRAPS : Iteration 1
[2026-05-22 23:23:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
TRAPS : Iteration 2
[2026-05-22 23:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
TRAPS : Iteration 3
[2026-05-22 23:23:32] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 23:23:32] [INFO ] After 1356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-22 23:23:32] [INFO ] Flatten gal took : 9 ms
[2026-05-22 23:23:32] [INFO ] Flatten gal took : 21 ms
[2026-05-22 23:23:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12080677008044037556.gal : 2 ms
[2026-05-22 23:23:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14175867351607990270.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12080677008044037556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14175867351607990270.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 ...330
Loading property file /tmp/ReachabilityCardinality14175867351607990270.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 189
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :189 after 1.52074e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.52074e+06 after 2.43316e+07
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.43316e+07 after 8.14623e+11
Detected timeout of ITS tools.
[2026-05-22 23:23:47] [INFO ] Flatten gal took : 9 ms
[2026-05-22 23:23:47] [INFO ] Applying decomposition
[2026-05-22 23:23:47] [INFO ] Flatten gal took : 7 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/graph13430611308385352065.txt' '-o' '/tmp/graph13430611308385352065.bin' '-w' '/tmp/graph13430611308385352065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13430611308385352065.bin' '-l' '-1' '-v' '-w' '/tmp/graph13430611308385352065.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:23:48] [INFO ] Decomposing Gal with order
[2026-05-22 23:23:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:23:48] [INFO ] Removed a total of 26 redundant transitions.
[2026-05-22 23:23:48] [INFO ] Flatten gal took : 65 ms
[2026-05-22 23:23:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-22 23:23:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8359074268746406537.gal : 4 ms
[2026-05-22 23:23:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6064876499927038096.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8359074268746406537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6064876499927038096.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality6064876499927038096.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 5.57923e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :5.25563e+10 after 3.05834e+15
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\_mod\_flat,7.50833e+15,1.07328,37684,4844,33,70068,319,633,112076,74,716,0
Total reachable state count : 7508325705802493

Verifying 3 reachability properties.
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-01 does not hold.

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-05b-ReachabilityFireability-2024-01,3.7557e+09,1.07695,37684,142,24,70068,319,633,112076,77,716,240
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-04 does not hold.

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-05b-ReachabilityFireability-2024-04,2.55506e+12,1.36315,37684,2783,36,75474,319,730,112076,84,716,103325
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-09 does not hold.

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-05b-ReachabilityFireability-2024-09,6.89474e+11,1.40408,37684,537,28,82790,319,758,112076,84,716,117968
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 18370 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 23:23:49] [INFO ] Flatten gal took : 31 ms
[2026-05-22 23:23:49] [INFO ] Applying decomposition
[2026-05-22 23:23:49] [INFO ] Flatten gal took : 18 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/graph15209955322353947701.txt' '-o' '/tmp/graph15209955322353947701.bin' '-w' '/tmp/graph15209955322353947701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15209955322353947701.bin' '-l' '-1' '-v' '-w' '/tmp/graph15209955322353947701.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:23:49] [INFO ] Decomposing Gal with order
[2026-05-22 23:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:23:49] [INFO ] Removed a total of 52 redundant transitions.
[2026-05-22 23:23:49] [INFO ] Flatten gal took : 30 ms
[2026-05-22 23:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-22 23:23:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14544999197741374669.gal : 8 ms
[2026-05-22 23:23:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3607483054044130277.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/ReachabilityCardinality14544999197741374669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3607483054044130277.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality3607483054044130277.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2.63831e+20 after 2.63831e+20
Detected timeout of ITS tools.
[2026-05-22 23:53:50] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16371703845667142086
[2026-05-22 23:53:50] [INFO ] Applying decomposition
[2026-05-22 23:53:50] [INFO ] Flatten gal took : 6 ms
[2026-05-22 23:53:50] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2026-05-22 23:53:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:53:50] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2026-05-22 23:53:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph12189911784337099814.txt' '-o' '/tmp/graph12189911784337099814.bin' '-w' '/tmp/graph12189911784337099814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12189911784337099814.bin' '-l' '-1' '-v' '-w' '/tmp/graph12189911784337099814.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:53:50] [INFO ] Decomposing Gal with order
[2026-05-22 23:53:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:53:50] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2026-05-22 23:53:50] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:53:50] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-22 23:53:50] [INFO ] Flatten gal took : 19 ms
[2026-05-22 23:53:50] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16371703845667142086
[2026-05-22 23:53:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2026-05-22 23:53:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18259597033047389982.gal : 4 ms
Running compilation step : cd /tmp/ltsmin16371703845667142086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 23:53:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11494124562565518748.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/ReachabilityFireability18259597033047389982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11494124562565518748.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityFireability11494124562565518748.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 441
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :222545 after 2.68259e+09
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-09 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.68259e+09 after 7.24612e+14
Compilation finished in 547 ms.
Running link step : cd /tmp/ltsmin16371703845667142086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16371703845667142086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'AutoFlightPT05bReachabilityFireability202401==true'
LTSmin run took 245 ms.
Found Violation
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin16371703845667142086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'AutoFlightPT05bReachabilityFireability202404==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
petri\_inst\_inst\_mod\_flat,4.86312e+15,1.75392,50616,3875,31,96444,341,700,145089,71,746,0
Total reachable state count : 4863118924248701

Verifying 3 reachability properties.
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-01 does not hold.

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-05b-ReachabilityFireability-2024-01,3.58318e+09,1.75899,50860,105,20,96444,341,700,145089,74,746,218
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-04 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-05b-ReachabilityFireability-2024-04,1.85131e+11,1.96027,50860,779,33,96444,341,795,145089,80,746,78693
Invariant property AutoFlight-PT-05b-ReachabilityFireability-2024-09 does not hold.

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-05b-ReachabilityFireability-2024-09,1.36443e+11,2.03174,50860,328,25,96444,341,868,145089,80,746,91569
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1910327 ms.

BK_STOP 1779494032313

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.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-05b"
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-05b, 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-177944366400519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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