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

About the Execution of ITS-Tools for AirplaneLD-COL-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
402.115 8871.00 22189.00 148.60 FFTFTTFTTTFFTFTF 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-177944365900057.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-COL-2000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944365900057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.5K Mar 4 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 4 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 4 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 4 16:55 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 4.1K Mar 15 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 4 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 4 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 4 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 4 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 328K 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-COL-2000-CTLCardinality-2024-00
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-01
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-02
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-03
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-04
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-05
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-06
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-07
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-08
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-09
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-10
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-11
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-12
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-13
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-14
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779461546235

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-2000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-22 14:52:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 14:52:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 14:52:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-22 14:52:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 14:52:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1054 ms
[2026-05-22 14:52:29] [INFO ] Detected 3 constant HL places corresponding to 6002 PT places.
[2026-05-22 14:52:29] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 14019 PT places and 24012.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
[2026-05-22 14:52:29] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 6 ms.
[2026-05-22 14:52:29] [INFO ] Skeletonized 16 HLPN properties in 7 ms.
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (5036 resets) in 2202 ms. (18 steps per ms) remains 47/61 properties
BEST_FIRST walk for 4003 steps (158 resets) in 59 ms. (66 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (129 resets) in 58 ms. (67 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (159 resets) in 139 ms. (28 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (137 resets) in 148 ms. (26 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (138 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (114 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (134 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (136 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (128 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (138 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (128 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (116 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (114 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (142 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (155 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (140 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (136 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (153 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (132 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (140 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (134 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (135 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (135 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (112 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (132 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (112 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (152 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (133 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (131 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (134 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (143 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (135 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (158 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (139 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (141 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (121 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (135 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (138 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (157 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (154 resets) in 54 ms. (72 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (135 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (130 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (137 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (139 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (113 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (139 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10578621952806917077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2608250429111049710.kers'
[2026-05-22 14:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10578621952806917077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2608250429111049710.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 16 cols 37 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 14:52:31] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2608250429111049710.kers
Total runtime 1 ms.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 28 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
After SMT solving in domain Real declared 31/31 variables, and 20 constraints, problems are : Problem set: 47 solved, 0 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 47 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 14:52:31] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2026-05-22 14:52:31] [INFO ] Flatten gal took : 18 ms
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 14:52:31] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:4000) in guard (OR (GEQ $A 1999) (EQ $A 3999))introduces in Altitude(4000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:4000) in guard (AND (LT $A 1999) (NEQ $A 3999))introduces in Altitude(4000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 4000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 1999) (EQ $A 3999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 1999) (NEQ $A 3999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 2000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 999) (NEQ $S 1999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 999) (NEQ $S 1999)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2026-05-22 14:52:31] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 68 ms.
[2026-05-22 14:52:31] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 20 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 7 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (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-16612989850124742312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1789026259028296669.kers'
[2026-05-22 14:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16612989850124742312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1789026259028296669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 50 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 14:52:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1789026259028296669.kers
Total runtime 2 ms.
[2026-05-22 14:52:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-22 14:52:31] [INFO ] Invariant cache hit.
[2026-05-22 14:52:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-22 14:52:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/42 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 24 constraints, problems are : Problem set: 0 solved, 10 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/42 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 34 constraints, problems are : Problem set: 0 solved, 10 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 682ms
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 822 ms. Remains : 22/23 places, 20/20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-22 14:52:32] [INFO ] Invariant cache hit.
[2026-05-22 14:52:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-22 14:52:32] [INFO ] Invariant cache hit.
[2026-05-22 14:52:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 20 out of 22 places after structural reductions.
[2026-05-22 14:52:32] [INFO ] Flatten gal took : 3 ms
[2026-05-22 14:52:32] [INFO ] Flatten gal took : 3 ms
[2026-05-22 14:52:32] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5031 resets) in 1309 ms. (30 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4002 steps (94 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (99 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (97 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (96 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (104 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (95 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (95 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (104 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (87 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (97 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (87 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (92 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (97 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (97 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (100 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (99 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (92 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
[2026-05-22 14:52:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/21 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 20/41 variables, 21/23 constraints. Problems are: Problem set: 14 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/23 constraints. Problems are: Problem set: 14 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 42/42 variables, and 24 constraints, problems are : Problem set: 17 solved, 0 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 17 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 17 atomic propositions for a total of 7 simplifications.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:33] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 13 out of 22 places (down from 17) after GAL structural reductions.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 6 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13779900433720808504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13505587645092931162.kers'
[2026-05-22 14:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13779900433720808504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13505587645092931162.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 40 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-05-22 14:52:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13505587645092931162.kers
Total runtime 0 ms.
[2026-05-22 14:52:33] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 18/22 places, 18/20 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:33] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14667872774447498353.gal : 1 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2575632076926184407.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14667872774447498353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2575632076926184407.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.019208,3812,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: AX(AX(AX(FALSE)))
=> equivalent forward existential formula: [(EY(EY(EY(Init))) * !(FALSE))] = FALSE
(forward)formula 0,0,0.019777,3848,1,0,8,219,7,1,128,156,3
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 1 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
[2026-05-22 14:52:33] [INFO ] Invariant cache hit.
[2026-05-22 14:52:33] [INFO ] Implicit Places using invariants in 90 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 18/22 places, 18/20 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17203431091395443114.gal : 0 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality516918322003645425.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17203431091395443114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality516918322003645425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.003604,3856,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.00381,3856,1,0,6,168,7,1,125,102,1
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 8 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 18 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (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-17633919117269673999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8107967003519291528.kers'
[2026-05-22 14:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17633919117269673999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8107967003519291528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 8 cols 17 entries
Finished phase 1 with 5 SingleSign rule and 2 generalized
[2026-05-22 14:52:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8107967003519291528.kers
Total runtime 0 ms.
[2026-05-22 14:52:33] [INFO ] Implicit Places using invariants in 61 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 93 ms. Remains : 7/22 places, 8/20 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 0 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3504906188257574517.gal : 1 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15130111703604525499.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3504906188257574517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15130111703604525499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16,0.005447,3768,2,16,5,66,6,0,36,44,0


Converting to forward existential form...Done !
original formula: EG(EF(((Weight_Right_Wheel_0+Weight_Right_Wheel_1)<=(Weight_Left_Wheel_0+Weight_Left_Wheel_1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((Weight_Right_Wheel_0+Weight_Right_Wheel_1)<=(Weight_Left_Wheel_0+Weight_Left_Wheel_1))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...169
(forward)formula 0,1,0.007662,4052,1,0,41,489,42,24,192,613,46
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 1 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4173568568778785360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11293719805363726301.kers'
[2026-05-22 14:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4173568568778785360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11293719805363726301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 40 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-05-22 14:52:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11293719805363726301.kers
Total runtime 0 ms.
[2026-05-22 14:52:33] [INFO ] Implicit Places using invariants in 81 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 18/22 places, 18/20 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 3 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 3 ms
[2026-05-22 14:52:33] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:33] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality2946484969941065872.gal : 4 ms
[2026-05-22 14:52:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16567809809744512980.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2946484969941065872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16567809809744512980.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.006797,3856,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: EF((((Weight_Left_Wheel_0+Weight_Left_Wheel_1)<=(TheAltitude_0+TheAltitude_1)) * AX(FALSE)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((Weight_Left_Wheel_0+Weight_Left_Wheel_1)<=(TheAltitude_0+TheAltitude_1))) * !(EX(!(FALSE)...168
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t15, t17, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.01475,4384,1,0,49,1204,52,20,459,1125,43
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 2 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
[2026-05-22 14:52:33] [INFO ] Invariant cache hit.
[2026-05-22 14:52:34] [INFO ] Implicit Places using invariants in 464 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 18/22 places, 18/20 transitions.
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:34] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7029185460453019713.gal : 1 ms
[2026-05-22 14:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11841272718662584170.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7029185460453019713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11841272718662584170.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.006024,3860,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: AG(AF(((stp4<=P3) * EX(TRUE))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((stp4<=P3) * EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t15, t17, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,0,0.014069,4272,1,0,62,1528,57,24,470,1619,58
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Applied a total of 2 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 20/20 (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-9577516668935092180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3837166003597411786.kers'
[2026-05-22 14:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9577516668935092180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3837166003597411786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 20 cols 44 entries
Finished phase 1 with 14 SingleSign rule and 5 generalized
[2026-05-22 14:52:34] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3837166003597411786.kers
Total runtime 1 ms.
[2026-05-22 14:52:34] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 14:52:34] [INFO ] Invariant cache hit.
[2026-05-22 14:52:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-22 14:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 224 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/40 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 275 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:34] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9602978338452922351.gal : 1 ms
[2026-05-22 14:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17549887178172832574.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9602978338452922351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17549887178172832574.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,484,0.007565,3884,2,49,5,186,6,0,97,112,0


Converting to forward existential form...Done !
original formula: AX(AF(E(AX((((Speed_Right_Wheel_0+Speed_Right_Wheel_1)<=stp4)||(P1>=79))) U (stp3<=P5))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(!(EX(!((((Speed_Right_Wheel_0+Speed_Right_Wheel_1)<=stp4)||(P1>=79))))) U (stp3<=P5))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t13, t15, t17, t19, Intersection with reachable at each step enabled. (destroyed/r...189
dead was empty
(forward)formula 0,1,0.018705,4300,1,0,73,1944,63,29,544,1957,72
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 1 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14073455708759231289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7461099849243723183.kers'
[2026-05-22 14:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14073455708759231289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7461099849243723183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 40 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-05-22 14:52:34] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7461099849243723183.kers
Total runtime 0 ms.
[2026-05-22 14:52:34] [INFO ] Implicit Places using invariants in 35 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 18/22 places, 18/20 transitions.
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:35] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-22 14:52:35] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:35] [INFO ] Flatten gal took : 1 ms
[2026-05-22 14:52:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5020683650958606620.gal : 1 ms
[2026-05-22 14:52:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13488517931241804020.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5020683650958606620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13488517931241804020.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,323,0.003942,3856,2,44,5,168,6,0,87,102,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.004193,3856,1,0,6,168,7,1,125,102,1
FORMULA AirplaneLD-COL-2000-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-22 14:52:35] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:52:35] [INFO ] Flatten gal took : 2 ms
Total runtime 6775 ms.

BK_STOP 1779461555106

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-COL-2000"
export BK_EXAMINATION="CTLCardinality"
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-COL-2000, examination is CTLCardinality"
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-177944365900057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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