About the Execution of ITS-Tools for AirplaneLD-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 536.451 | 15609.00 | 31532.00 | 209.10 | FTFTTFTTFFTFFFFF | 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-177944365900107.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 AirplaneLD-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944365900107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 118K Mar 4 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 457K Mar 4 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 91K Mar 4 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 546K Mar 4 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 48K Mar 15 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 15 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Mar 15 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Mar 15 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 199K Mar 4 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 720K Mar 4 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K Mar 4 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 979K Mar 4 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 15 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K Mar 15 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 872K 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 AirplaneLD-PT-0200-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779461643203
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 14:54:04] [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]
[2026-05-22 14:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 14:54:05] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2026-05-22 14:54:05] [INFO ] Transformed 1419 places.
[2026-05-22 14:54:05] [INFO ] Transformed 1608 transitions.
[2026-05-22 14:54:05] [INFO ] Found NUPN structural information;
[2026-05-22 14:54:05] [INFO ] Parsed PT model containing 1419 places and 1608 transitions and 6128 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 602 places and 0 transitions.
FORMULA AirplaneLD-PT-0200-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 816 transition count 1608
Discarding 789 places :
Symmetric choice reduction at 1 with 789 rule applications. Total rules 790 place count 27 transition count 819
Iterating global reduction 1 with 789 rules applied. Total rules applied 1579 place count 27 transition count 819
Ensure Unique test removed 789 transitions
Reduce isomorphic transitions removed 789 transitions.
Iterating post reduction 1 with 789 rules applied. Total rules applied 2368 place count 27 transition count 30
Applied a total of 2368 rules in 145 ms. Remains 27 /817 variables (removed 790) and now considering 30/1608 (removed 1578) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4977032008335036950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14275907520397635115.kers'
[2026-05-22 14:54:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4977032008335036950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14275907520397635115.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 27 cols 75 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-22 14:54:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14275907520397635115.kers
Total runtime 1 ms.
[2026-05-22 14:54:06] [INFO ] Implicit Places using invariants in 353 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/817 places, 30/1608 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 26/817 places, 30/1608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15267363248510978415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10192528845008331778.kers'
[2026-05-22 14:54:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15267363248510978415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10192528845008331778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 26 cols 73 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-22 14:54:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10192528845008331778.kers
Total runtime 7 ms.
[2026-05-22 14:54:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 14:54:06] [INFO ] Invariant cache hit.
[2026-05-22 14:54:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-22 14:54:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 3/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 30/52 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4/56 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 3/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 30/52 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 4/56 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 42 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1887ms
Finished structural reductions in LTL mode , in 1 iterations and 2042 ms. Remains : 26/26 places, 30/30 transitions.
Support contains 16 out of 26 places after structural reductions.
[2026-05-22 14:54:08] [INFO ] Flatten gal took : 38 ms
[2026-05-22 14:54:08] [INFO ] Flatten gal took : 19 ms
[2026-05-22 14:54:08] [INFO ] Input system was already deterministic with 30 transitions.
RANDOM walk for 148 steps (16 resets) in 14 ms. (9 steps per ms) remains 0/13 properties
FORMULA AirplaneLD-PT-0200-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 30 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 30
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Graph (complete) has 38 edges and 26 vertex of which 6 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 6
Applied a total of 3 rules in 15 ms. Remains 5 /26 variables (removed 21) and now considering 6/30 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10384113979605689716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1377951855817261770.kers'
[2026-05-22 14:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10384113979605689716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1377951855817261770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-22 14:54:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1377951855817261770.kers
Total runtime 1 ms.
[2026-05-22 14:54:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-22 14:54:09] [INFO ] Invariant cache hit.
[2026-05-22 14:54:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-22 14:54:09] [INFO ] Redundant transitions in 1 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-22 14:54:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 93 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 6/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 5/26 places, 6/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 222 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-02
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-02 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||F(p1))) U G(p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 30
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 18 transition count 24
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 18 transition count 24
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 18 transition count 18
Applied a total of 20 rules in 1 ms. Remains 18 /26 variables (removed 8) and now considering 18/30 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3163493333493385961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16108542418347462502.kers'
[2026-05-22 14:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3163493333493385961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16108542418347462502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 18 cols 38 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 14:54:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16108542418347462502.kers
Total runtime 0 ms.
[2026-05-22 14:54:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 14:54:09] [INFO ] Invariant cache hit.
[2026-05-22 14:54:10] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-22 14:54:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 190 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 233 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 430ms
Starting structural reductions in LTL mode, iteration 1 : 18/26 places, 18/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 18/26 places, 18/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||F(p1))) U G(p0)))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-03
Product exploration explored 100000 steps with 17528 reset in 362 ms.
Product exploration explored 100000 steps with 17565 reset in 182 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (5044 resets) in 692 ms. (57 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1088 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2026-05-22 14:54:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/30 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/35 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 7/36 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[State Equation: 2/18 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 15 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 640 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLCardinality-03 finished in 2332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 29
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 20 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 20 transition count 24
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 17 place count 20 transition count 19
Applied a total of 17 rules in 7 ms. Remains 20 /26 variables (removed 6) and now considering 19/30 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2813599915790132947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12755536416854091974.kers'
[2026-05-22 14:54:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2813599915790132947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12755536416854091974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 19 rows 20 cols 46 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 14:54:12] [INFO ] Computed 1 invariants in 12 ms
Computed 1 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12755536416854091974.kers
Total runtime 12 ms.
[2026-05-22 14:54:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 14:54:12] [INFO ] Invariant cache hit.
[2026-05-22 14:54:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-22 14:54:12] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-22 14:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/39 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/39 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 30 constraints, problems are : Problem set: 0 solved, 9 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/26 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 888 ms. Remains : 20/26 places, 19/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-04
Product exploration explored 100000 steps with 14164 reset in 95 ms.
Product exploration explored 100000 steps with 14164 reset in 167 ms.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
[2026-05-22 14:54:13] [INFO ] Invariant cache hit.
[2026-05-22 14:54:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-22 14:54:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-22 14:54:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 14:54:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:54:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-22 14:54:13] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 14:54:13] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 577 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2026-05-22 14:54:13] [INFO ] Invariant cache hit.
[2026-05-22 14:54:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-22 14:54:13] [INFO ] Invariant cache hit.
[2026-05-22 14:54:14] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-22 14:54:14] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 20/20 places, 19/19 transitions.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
[2026-05-22 14:54:14] [INFO ] Invariant cache hit.
[2026-05-22 14:54:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:54:14] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-22 14:54:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 14:54:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:54:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-22 14:54:14] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 14:54:14] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 550 ms.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14189 reset in 88 ms.
Product exploration explored 100000 steps with 14217 reset in 79 ms.
Built C files in :
/tmp/ltsmin1652547883595840628
[2026-05-22 14:54:15] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2026-05-22 14:54:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:54:15] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2026-05-22 14:54:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:54:15] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2026-05-22 14:54:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:54:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1652547883595840628
Running compilation step : cd /tmp/ltsmin1652547883595840628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin1652547883595840628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1652547883595840628;'/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' '--hoa' '/tmp/stateBased14489322210365360671.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0200-LTLCardinality-04 finished in 3483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 30
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 18 transition count 24
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 18 transition count 24
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 18 transition count 18
Applied a total of 20 rules in 3 ms. Remains 18 /26 variables (removed 8) and now considering 18/30 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-960218382565264090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11212764452914105398.kers'
[2026-05-22 14:54:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-960218382565264090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11212764452914105398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 18 cols 38 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 14:54:15] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11212764452914105398.kers
Total runtime 1 ms.
[2026-05-22 14:54:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-22 14:54:15] [INFO ] Invariant cache hit.
[2026-05-22 14:54:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-22 14:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 231 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 147 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 380ms
Starting structural reductions in LTL mode, iteration 1 : 18/26 places, 18/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 18/26 places, 18/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-05 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 19 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 19 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 17 place count 19 transition count 20
Applied a total of 17 rules in 1 ms. Remains 19 /26 variables (removed 7) and now considering 20/30 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3333477471379662573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9993549540289798022.kers'
[2026-05-22 14:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3333477471379662573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9993549540289798022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 43 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 14:54:16] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9993549540289798022.kers
Total runtime 0 ms.
[2026-05-22 14:54:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-22 14:54:16] [INFO ] Invariant cache hit.
[2026-05-22 14:54:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-22 14:54:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 207 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 10 unsolved in 188 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 399ms
Starting structural reductions in LTL mode, iteration 1 : 19/26 places, 20/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 19/26 places, 20/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-13 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 19 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 19 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 17 place count 19 transition count 20
Applied a total of 17 rules in 1 ms. Remains 19 /26 variables (removed 7) and now considering 20/30 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2732556755966870968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15607561498080133411.kers'
[2026-05-22 14:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2732556755966870968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15607561498080133411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 43 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 14:54:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15607561498080133411.kers
Total runtime 1 ms.
[2026-05-22 14:54:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 14:54:17] [INFO ] Invariant cache hit.
[2026-05-22 14:54:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 19/26 places, 20/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 19/26 places, 20/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&p1)))'
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-14 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 30/30 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 19 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 19 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 17 place count 19 transition count 20
Applied a total of 17 rules in 1 ms. Remains 19 /26 variables (removed 7) and now considering 20/30 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13825776007064612245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7929643120215554148.kers'
[2026-05-22 14:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13825776007064612245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7929643120215554148.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 14:54:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7929643120215554148.kers
Total runtime 0 ms.
[2026-05-22 14:54:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 14:54:17] [INFO ] Invariant cache hit.
[2026-05-22 14:54:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-22 14:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 333 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 10 unsolved in 206 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in LTL mode, iteration 1 : 19/26 places, 20/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 19/26 places, 20/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 32 steps with 3 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-15 finished in 948 ms.
All properties solved by simple procedures.
Total runtime 13468 ms.
BK_STOP 1779461658812
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="AirplaneLD-PT-0200"
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-5973"
echo " Executing tool itstools"
echo " Input is AirplaneLD-PT-0200, 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-oct2-177944365900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0200.tgz
mv AirplaneLD-PT-0200 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 '
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 ;
