fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500395
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCflexbar-PT-2a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
476.991 87313.00 117153.00 327.90 TFTFFTFTFFTFFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DLCflexbar-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Mar 6 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 15:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 15:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K Mar 6 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 545K 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 DLCflexbar-PT-2a-LTLCardinality-00
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-01
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-02
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-03
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-04
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-05
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-06
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-07
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-08
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-09
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-10
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-11
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-12
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-13
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-14
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779607244814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-2a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 07:20:46] [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-24 07:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:20:46] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-05-24 07:20:46] [INFO ] Transformed 353 places.
[2026-05-24 07:20:46] [INFO ] Transformed 2169 transitions.
[2026-05-24 07:20:46] [INFO ] Found NUPN structural information;
[2026-05-24 07:20:46] [INFO ] Parsed PT model containing 353 places and 2169 transitions and 8205 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 264 transitions
Reduce redundant transitions removed 264 transitions.
FORMULA DLCflexbar-PT-2a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 1905/1905 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 308 transition count 1520
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 308 transition count 1520
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 108 place count 308 transition count 1502
Drop transitions (Redundant composition of simpler transitions.) removed 436 transitions
Redundant transition composition rules discarded 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 544 place count 308 transition count 1066
Applied a total of 544 rules in 108 ms. Remains 308 /353 variables (removed 45) and now considering 1066/1905 (removed 839) transitions.
[2026-05-24 07:20:46] [INFO ] Flow matrix only has 203 transitions (discarded 863 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18257759897537975898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10600390830025346161.kers'
[2026-05-24 07:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18257759897537975898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10600390830025346161.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 172 columns.
Culled 172 columns in 0 ms.
// Phase 1: matrix 202 rows 136 cols 427 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 07:20:46] [INFO ] Computed 196 invariants in 0 ms
Computed 196 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10600390830025346161.kers
Total runtime 1 ms.
[2026-05-24 07:20:47] [INFO ] Implicit Places using invariants in 831 ms returned [136, 137, 138, 139, 140, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 199, 200, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307]
Discarding 161 places :
Ensure Unique test removed 749 transitions
Reduce isomorphic transitions removed 749 transitions.
Implicit Place search using SMT only with invariants took 865 ms to find 161 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/353 places, 317/1905 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 147 transition count 261
Applied a total of 56 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 261/317 (removed 56) transitions.
[2026-05-24 07:20:47] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15669403763257312457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1564053257921776333.kers'
[2026-05-24 07:20:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15669403763257312457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1564053257921776333.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 202 rows 136 cols 427 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 07:20:47] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1564053257921776333.kers
Total runtime 1 ms.
[2026-05-24 07:20:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 07:20:47] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 07:20:47] [INFO ] Invariant cache hit.
[2026-05-24 07:20:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/353 places, 261/1905 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1141 ms. Remains : 147/353 places, 261/1905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2026-05-24 07:20:47] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 07:20:47] [INFO ] Invariant cache hit.
[2026-05-24 07:20:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 07:20:47] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 07:20:47] [INFO ] Invariant cache hit.
[2026-05-24 07:20:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-24 07:20:47] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 07:20:47] [INFO ] Invariant cache hit.
[2026-05-24 07:20:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 11/147 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 202/349 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 183 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14542 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 11/147 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 202/349 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 260/442 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 443 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13007 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27612ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 27635ms
Finished structural reductions in LTL mode , in 1 iterations and 27783 ms. Remains : 147/147 places, 261/261 transitions.
Support contains 17 out of 147 places after structural reductions.
[2026-05-24 07:21:15] [INFO ] Flatten gal took : 34 ms
[2026-05-24 07:21:15] [INFO ] Flatten gal took : 13 ms
[2026-05-24 07:21:15] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 15 out of 147 places (down from 17) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1537 ms. (26 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
[2026-05-24 07:21:16] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 07:21:16] [INFO ] Invariant cache hit.
[2026-05-24 07:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 127/147 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 202/349 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 183 constraints, problems are : Problem set: 0 solved, 4 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 20/350 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 8/35 constraints, State Equation: 0/147 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA DLCflexbar-PT-2a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 1 stable transitions
Graph (complete) has 295 edges and 147 vertex of which 136 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 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' '!(F(p0))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Graph (trivial) has 253 edges and 147 vertex of which 130 / 147 are part of one of the 24 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 71 edges and 41 vertex of which 30 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 44 rules applied. Total rules applied 46 place count 7 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 6 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 6 transition count 8
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 2 with 1 rules applied. Total rules applied 54 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 4 transition count 5
Applied a total of 58 rules in 12 ms. Remains 4 /147 variables (removed 143) and now considering 5/261 (removed 256) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12249263983821597630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-231578086887518954.kers'
[2026-05-24 07:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12249263983821597630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-231578086887518954.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 07:21:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-231578086887518954.kers
Total runtime 0 ms.
[2026-05-24 07:21:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 07:21:16] [INFO ] Invariant cache hit.
[2026-05-24 07:21:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 07:21:16] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-24 07:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/147 places, 5/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 4/147 places, 5/261 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(p0))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-2a-LTLCardinality-01 finished in 338 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' '!(F(p0))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Graph (trivial) has 260 edges and 147 vertex of which 135 / 147 are part of one of the 24 SCC in 0 ms
Free SCC test removed 111 places
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Graph (complete) has 59 edges and 36 vertex of which 26 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 25 place count 3 transition count 2
Iterating global reduction 0 with 23 rules applied. Total rules applied 48 place count 3 transition count 2
Applied a total of 48 rules in 10 ms. Remains 3 /147 variables (removed 144) and now considering 2/261 (removed 259) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15594604158567926574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1010383969398148503.kers'
[2026-05-24 07:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15594604158567926574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1010383969398148503.kers]
Normalized transition count is 1 out of 2 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 07:21:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1010383969398148503.kers
Total runtime 1 ms.
[2026-05-24 07:21:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 07:21:16] [INFO ] Invariant cache hit.
[2026-05-24 07:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:21:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 07:21:16] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 07:21:16] [INFO ] Invariant cache hit.
[2026-05-24 07:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/147 places, 2/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 3/147 places, 2/261 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(p0))'
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 15 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 23 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-2a-LTLCardinality-07 finished in 493 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)||G(p1))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 137 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 135 transition count 257
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 135 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 135 transition count 256
Applied a total of 15 rules in 8 ms. Remains 135 /147 variables (removed 12) and now considering 256/261 (removed 5) transitions.
[2026-05-24 07:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13954892652132422193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3465062650335025011.kers'
[2026-05-24 07:21:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13954892652132422193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3465062650335025011.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 421 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:21:17] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3465062650335025011.kers
Total runtime 1 ms.
[2026-05-24 07:21:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 07:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:21:17] [INFO ] Invariant cache hit.
[2026-05-24 07:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:21:17] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 07:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2026-05-24 07:21:17] [INFO ] Invariant cache hit.
[2026-05-24 07:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/334 variables, 135/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 161 constraints, problems are : Problem set: 0 solved, 255 unsolved in 13417 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/334 variables, 135/160 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 255/415 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 416 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11969 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25438ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 25439ms
Starting structural reductions in LTL mode, iteration 1 : 135/147 places, 256/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25568 ms. Remains : 135/147 places, 256/261 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)||G(p1))))'
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 403 steps with 0 reset in 4 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-2a-LTLCardinality-11 finished in 25788 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' '!(F(G(p0)))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Graph (trivial) has 257 edges and 147 vertex of which 134 / 147 are part of one of the 24 SCC in 1 ms
Free SCC test removed 110 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Graph (complete) has 62 edges and 37 vertex of which 26 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 2 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 2 transition count 3
Applied a total of 49 rules in 2 ms. Remains 2 /147 variables (removed 145) and now considering 3/261 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5086903910247735072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9317229530508368618.kers'
[2026-05-24 07:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5086903910247735072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9317229530508368618.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 07:21:43] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9317229530508368618.kers
Total runtime 0 ms.
[2026-05-24 07:21:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 07:21:43] [INFO ] Invariant cache hit.
[2026-05-24 07:21:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 07:21:43] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 07:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/147 places, 3/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 2/147 places, 3/261 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 46 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-2a-LTLCardinality-12 finished in 177 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(p0)))))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 261/261 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 137 transition count 261
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 134 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 134 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 134 transition count 253
Applied a total of 18 rules in 10 ms. Remains 134 /147 variables (removed 13) and now considering 253/261 (removed 8) transitions.
[2026-05-24 07:21:43] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7355664074236116257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6885149324265367877.kers'
[2026-05-24 07:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7355664074236116257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6885149324265367877.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:21:43] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6885149324265367877.kers
Total runtime 1 ms.
[2026-05-24 07:21:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 07:21:43] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:21:43] [INFO ] Invariant cache hit.
[2026-05-24 07:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:21:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 07:21:43] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:21:43] [INFO ] Invariant cache hit.
[2026-05-24 07:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/332 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 160 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13176 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/331 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 252/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 412 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11527 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24723ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 24724ms
Starting structural reductions in LTL mode, iteration 1 : 134/147 places, 253/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24841 ms. Remains : 134/147 places, 253/261 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(p0)))))'
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-13
Product exploration explored 100000 steps with 25000 reset in 469 ms.
Product exploration explored 100000 steps with 25000 reset in 336 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 277 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/134 stabilizing places and 1/253 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-24 07:22:09] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:22:09] [INFO ] Invariant cache hit.
[2026-05-24 07:22:09] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2026-05-24 07:22:09] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-24 07:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:22:09] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-24 07:22:09] [INFO ] Computed and/alt/rep : 196/408/196 causal constraints (skipped 1 transitions) in 11 ms.
[2026-05-24 07:22:09] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 420 ms.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 134 /134 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-24 07:22:09] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:22:09] [INFO ] Invariant cache hit.
[2026-05-24 07:22:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 07:22:09] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:22:09] [INFO ] Invariant cache hit.
[2026-05-24 07:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:22:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 134/134 places, 253/253 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 277 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/134 stabilizing places and 1/253 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 47 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-24 07:22:10] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 07:22:10] [INFO ] Invariant cache hit.
[2026-05-24 07:22:10] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2026-05-24 07:22:10] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-24 07:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:22:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-24 07:22:10] [INFO ] Computed and/alt/rep : 196/408/196 causal constraints (skipped 1 transitions) in 11 ms.
[2026-05-24 07:22:10] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 473 ms.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 289 ms.
Product exploration explored 100000 steps with 25000 reset in 282 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2176981102891568611
[2026-05-24 07:22:11] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2176981102891568611
Running compilation step : cd /tmp/ltsmin2176981102891568611;'/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 457 ms.
Running link step : cd /tmp/ltsmin2176981102891568611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2176981102891568611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16435610219971565051.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCflexbar-PT-2a-LTLCardinality-13 finished in 28758 ms.
All properties solved by simple procedures.
Total runtime 86066 ms.

BK_STOP 1779607332127

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="DLCflexbar-PT-2a"
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 DLCflexbar-PT-2a, 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 r098-tall-177955695500395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-2a.tgz
mv DLCflexbar-PT-2a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;