Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729600598.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AutoFlight-PT-96b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729600598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.9M May 29 14:32 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-96b-ReachabilityCardinality-2025-00
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-01
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-02
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-03
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-04
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-05
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-06
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-07
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-08
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-09
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-10
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-11
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-12
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-13
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-14
FORMULA_NAME AutoFlight-PT-96b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748645474381

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 22:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 22:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:51:15] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2025-05-30 22:51:16] [INFO ] Transformed 7894 places.
[2025-05-30 22:51:16] [INFO ] Transformed 7868 transitions.
[2025-05-30 22:51:16] [INFO ] Found NUPN structural information;
[2025-05-30 22:51:16] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2299 ms. (17 steps per ms) remains 10/14 properties
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
// Phase 1: matrix 7868 rows 7894 cols
[2025-05-30 22:51:18] [INFO ] Flatten gal took : 642 ms
[2025-05-30 22:51:18] [INFO ] Computed 514 invariants in 131 ms
[2025-05-30 22:51:18] [INFO ] Flatten gal took : 294 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-05-30 22:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16454697065499676368.gal : 106 ms
[2025-05-30 22:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1993387102193295393.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16454697065499676368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1993387102193295393.prop' '--nowitness' '--gen-order' 'FOLLOW'
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality1993387102193295393.prop.
At refinement iteration 2 (OVERLAPS) 7467/7609 variables, 492/634 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7609/15762 variables, and 8101 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5087 ms.
Refiners :[Domain max(s): 7609/7894 constraints, Positive P Invariants (semi-flows): 492/513 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/7894 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 7467/7609 variables, 492/634 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7609 variables, 7467/8101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7609/15762 variables, and 8101 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5030 ms.
Refiners :[Domain max(s): 7609/7894 constraints, Positive P Invariants (semi-flows): 492/513 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/7894 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10553ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 142 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3234 transitions
Trivial Post-agglo rules discarded 3234 transitions
Performed 3234 trivial Post agglomeration. Transition count delta: 3234
Iterating post reduction 0 with 3234 rules applied. Total rules applied 3234 place count 7894 transition count 4634
Reduce places removed 3234 places and 0 transitions.
Ensure Unique test removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 1 with 3766 rules applied. Total rules applied 7000 place count 4660 transition count 4102
Reduce places removed 174 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 230 rules applied. Total rules applied 7230 place count 4486 transition count 4046
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 64 rules applied. Total rules applied 7294 place count 4430 transition count 4038
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 7296 place count 4428 transition count 4038
Performed 983 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 983 Pre rules applied. Total rules applied 7296 place count 4428 transition count 3055
Deduced a syphon composed of 983 places in 91 ms
Reduce places removed 983 places and 0 transitions.
Iterating global reduction 5 with 1966 rules applied. Total rules applied 9262 place count 3445 transition count 3055
Discarding 647 places :
Symmetric choice reduction at 5 with 647 rule applications. Total rules 9909 place count 2798 transition count 2408
Iterating global reduction 5 with 647 rules applied. Total rules applied 10556 place count 2798 transition count 2408
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 10560 place count 2798 transition count 2404
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 199 Pre rules applied. Total rules applied 10560 place count 2798 transition count 2205
Deduced a syphon composed of 199 places in 35 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 6 with 398 rules applied. Total rules applied 10958 place count 2599 transition count 2205
Performed 626 Post agglomeration using F-continuation condition.Transition count delta: 626
Deduced a syphon composed of 626 places in 11 ms
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 6 with 1252 rules applied. Total rules applied 12210 place count 1973 transition count 1579
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 12218 place count 1969 transition count 1580
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 12229 place count 1969 transition count 1569
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 12233 place count 1967 transition count 1567
Free-agglomeration rule applied 274 times.
Iterating global reduction 6 with 274 rules applied. Total rules applied 12507 place count 1967 transition count 1293
Reduce places removed 274 places and 0 transitions.
Iterating post reduction 6 with 274 rules applied. Total rules applied 12781 place count 1693 transition count 1293
Applied a total of 12781 rules in 2490 ms. Remains 1693 /7894 variables (removed 6201) and now considering 1293/7868 (removed 6575) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2499 ms. Remains : 1693/7894 places, 1293/7868 transitions.
RANDOM walk for 40000 steps (191 resets) in 818 ms. (48 steps per ms) remains 3/10 properties
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 823 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 395 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 380 ms. (104 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1293 rows 1693 cols
[2025-05-30 22:51:32] [INFO ] Computed 514 invariants in 24 ms
[2025-05-30 22:51:32] [INFO ] State equation strengthened by 696 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 278/308 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1304/1612 variables, 471/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1612 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 81/1693 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1693 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1293/2986 variables, 1693/2207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2986 variables, 696/2903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2986 variables, 0/2903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2986 variables, 0/2903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2986/2986 variables, and 2903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1693/1693 constraints, ReadFeed: 696/696 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 278/308 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:34] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1304/1612 variables, 471/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:34] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:34] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:35] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:35] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:35] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:35] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:35] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:36] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:36] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:36] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:36] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:37] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:37] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:37] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:37] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:38] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:38] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:38] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:38] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:38] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1612 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:39] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:39] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:39] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:39] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:40] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:41] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:41] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:41] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:41] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:41] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:42] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:42] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:42] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1612 variables, 18/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:42] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1612 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1612 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 81/1693 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:43] [INFO ] Deduced a trap composed of 9 places in 369 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:43] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:44] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:44] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:45] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:45] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:45] [INFO ] Deduced a trap composed of 22 places in 355 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:46] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:46] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:47] [INFO ] Deduced a trap composed of 34 places in 365 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:47] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:47] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:48] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:48] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:49] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 69 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1693 variables, 15/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1693 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1293/2986 variables, 1693/2264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2986 variables, 696/2960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2986 variables, 2/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2986 variables, 0/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2986 variables, 0/2962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2986/2986 variables, and 2962 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17956 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1693/1693 constraints, ReadFeed: 696/696 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19860ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 377 ms.
Support contains 30 out of 1693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1693/1693 places, 1293/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1693 transition count 1228
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 1628 transition count 1226
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 1626 transition count 1225
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 135 place count 1626 transition count 1200
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 185 place count 1601 transition count 1200
Performed 72 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 329 place count 1529 transition count 1126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 336 place count 1529 transition count 1119
Renaming transitions due to excessive name length > 1024 char.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 340 place count 1527 transition count 1117
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 354 place count 1527 transition count 1103
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 368 place count 1513 transition count 1103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 1512 transition count 1102
Reduce places removed 171 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 5 with 315 rules applied. Total rules applied 684 place count 1341 transition count 958
Reduce places removed 144 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 147 rules applied. Total rules applied 831 place count 1197 transition count 955
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 834 place count 1194 transition count 955
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 123 Pre rules applied. Total rules applied 834 place count 1194 transition count 832
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 8 with 246 rules applied. Total rules applied 1080 place count 1071 transition count 832
Applied a total of 1080 rules in 352 ms. Remains 1071 /1693 variables (removed 622) and now considering 832/1293 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 1071/1693 places, 832/1293 transitions.
RANDOM walk for 40000 steps (241 resets) in 1215 ms. (32 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
// Phase 1: matrix 832 rows 1071 cols
[2025-05-30 22:51:53] [INFO ] Computed 343 invariants in 6 ms
[2025-05-30 22:51:53] [INFO ] State equation strengthened by 471 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/152 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/279 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/642 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 265/907 variables, 95/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 832/1739 variables, 907/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1739 variables, 471/1639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1739 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 164/1903 variables, 164/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1903 variables, 82/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1903 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1903 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1903/1903 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 341/341 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1071/1071 constraints, ReadFeed: 471/471 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
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/152 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/279 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/642 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 265/907 variables, 95/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:54] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:54] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:54] [INFO ] Deduced a trap composed of 494 places in 323 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:55] [INFO ] Deduced a trap composed of 524 places in 313 ms of which 120 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/907 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 832/1739 variables, 907/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1739 variables, 471/1643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1739 variables, 1/1644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 22:51:55] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1739 variables, 1/1645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1739 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 164/1903 variables, 164/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1903 variables, 82/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1903 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1903 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1903/1903 variables, and 1891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2612 ms.
Refiners :[Positive P Invariants (semi-flows): 341/341 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1071/1071 constraints, ReadFeed: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3350ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 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 40911 ms.

BK_STOP 1748645516497

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

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