fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729300459
Last Updated
June 24, 2025

About the Execution of ITS-Tools for AutoFlight-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 12502.00 0.00 0.00 TFFTFFFFFFFFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729300459.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-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729300459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K 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.6K 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 16K 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-02a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748621944300

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 16:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 16:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 16:19:05] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2025-05-30 16:19:05] [INFO ] Transformed 57 places.
[2025-05-30 16:19:05] [INFO ] Transformed 55 transitions.
[2025-05-30 16:19:05] [INFO ] Found NUPN structural information;
[2025-05-30 16:19:05] [INFO ] Parsed PT model containing 57 places and 55 transitions and 180 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2025-05-30 16:19:05] [INFO ] Computed 16 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:06] [INFO ] Implicit Places using invariants in 212 ms returned [7, 14, 17, 32, 42, 48, 54, 56]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 243 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 45/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 42
Applied a total of 6 rules in 9 ms. Remains 46 /49 variables (removed 3) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 46 cols
[2025-05-30 16:19:06] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 16:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 16:19:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/57 places, 42/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 46/57 places, 42/45 transitions.
Support contains 17 out of 46 places after structural reductions.
[2025-05-30 16:19:06] [INFO ] Flatten gal took : 18 ms
[2025-05-30 16:19:06] [INFO ] Flatten gal took : 15 ms
[2025-05-30 16:19:06] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 2349 steps (91 resets) in 109 ms. (21 steps per ms) remains 0/12 properties
FORMULA AutoFlight-PT-02a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-02a-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 41 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 40 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 40 transition count 36
Applied a total of 12 rules in 7 ms. Remains 40 /46 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 40 cols
[2025-05-30 16:19:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 16:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 16:19:06] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2025-05-30 16:19:06] [INFO ] Invariant cache hit.
[2025-05-30 16:19:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 36/76 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 49 constraints, problems are : Problem set: 0 solved, 35 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 36/76 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 84 constraints, problems are : Problem set: 0 solved, 35 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1682ms
Starting structural reductions in LTL mode, iteration 1 : 40/46 places, 36/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1799 ms. Remains : 40/46 places, 36/42 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-01 finished in 2199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 42/42 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 44 transition count 27
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 30 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 30 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 26 transition count 25
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 26 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 23 transition count 22
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 23 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 53 place count 17 transition count 16
Applied a total of 53 rules in 25 ms. Remains 17 /46 variables (removed 29) and now considering 16/42 (removed 26) transitions.
// Phase 1: matrix 16 rows 17 cols
[2025-05-30 16:19:08] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 16:19:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:19:08] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-05-30 16:19:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 30 constraints, problems are : Problem set: 0 solved, 8 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/46 places, 16/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 17/46 places, 16/42 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-07
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-07 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (X(F(p1))||G(p2))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 41 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 40 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 40 transition count 36
Applied a total of 12 rules in 5 ms. Remains 40 /46 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 40 cols
[2025-05-30 16:19:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:09] [INFO ] Implicit Places using invariants in 48 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/46 places, 36/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 39/46 places, 36/42 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-10
Product exploration explored 100000 steps with 16342 reset in 417 ms.
Product exploration explored 100000 steps with 16330 reset in 209 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 p0 (NOT p1))), (X (AND p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 627 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
RANDOM walk for 4688 steps (181 resets) in 76 ms. (60 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 p0 (NOT p1))), (X (AND p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 894 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 39 transition count 28
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 31 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 31 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 30 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 25 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 24 transition count 33
Applied a total of 30 rules in 6 ms. Remains 24 /39 variables (removed 15) and now considering 33/36 (removed 3) transitions.
// Phase 1: matrix 33 rows 24 cols
[2025-05-30 16:19:12] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:12] [INFO ] Implicit Places using invariants in 32 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/39 places, 33/36 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 23 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 32
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 22 cols
[2025-05-30 16:19:12] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 16:19:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 16:19:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/39 places, 32/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 22/39 places, 32/36 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 689 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
RANDOM walk for 307 steps (20 resets) in 14 ms. (20 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 1154 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p2)), (AND p2 (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), false, false, false, false]
Product exploration explored 100000 steps with 29391 reset in 143 ms.
Stack based approach found an accepted trace after 5095 steps with 1519 reset with depth 7 and stack size 7 in 6 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-10 finished in 6957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 41 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 40 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 40 transition count 36
Applied a total of 12 rules in 12 ms. Remains 40 /46 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 40 cols
[2025-05-30 16:19:16] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:16] [INFO ] Implicit Places using invariants in 44 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/46 places, 36/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 39/46 places, 36/42 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02a-LTLCardinality-12 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 40
Applied a total of 4 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 44 cols
[2025-05-30 16:19:16] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:16] [INFO ] Implicit Places using invariants in 31 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 40/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 43/46 places, 40/42 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 65 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-13 finished in 228 ms.
All properties solved by simple procedures.
Total runtime 11235 ms.

BK_STOP 1748621956802

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-02a"
export BK_EXAMINATION="LTLCardinality"
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-02a, examination is LTLCardinality"
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-174853729300459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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