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-177944366100284.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 ASLink-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-LTLFireability-00
FORMULA_NAME ASLink-PT-01a-LTLFireability-01
FORMULA_NAME ASLink-PT-01a-LTLFireability-02
FORMULA_NAME ASLink-PT-01a-LTLFireability-03
FORMULA_NAME ASLink-PT-01a-LTLFireability-04
FORMULA_NAME ASLink-PT-01a-LTLFireability-05
FORMULA_NAME ASLink-PT-01a-LTLFireability-06
FORMULA_NAME ASLink-PT-01a-LTLFireability-07
FORMULA_NAME ASLink-PT-01a-LTLFireability-08
FORMULA_NAME ASLink-PT-01a-LTLFireability-09
FORMULA_NAME ASLink-PT-01a-LTLFireability-10
FORMULA_NAME ASLink-PT-01a-LTLFireability-11
FORMULA_NAME ASLink-PT-01a-LTLFireability-12
FORMULA_NAME ASLink-PT-01a-LTLFireability-13
FORMULA_NAME ASLink-PT-01a-LTLFireability-14
FORMULA_NAME ASLink-PT-01a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779470239566

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 17:17:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:17:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:17:21] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-22 17:17:21] [INFO ] Transformed 431 places.
[2026-05-22 17:17:21] [INFO ] Transformed 735 transitions.
[2026-05-22 17:17:21] [INFO ] Found NUPN structural information;
[2026-05-22 17:17:21] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 728
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 420 transition count 718
Ensure Unique test removed 1 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 419 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 419 transition count 716
Applied a total of 19 rules in 77 ms. Remains 419 /431 variables (removed 12) and now considering 716/728 (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-16835909295399717681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1181443322680831769.kers'
[2026-05-22 17:17:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16835909295399717681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1181443322680831769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 716 rows 419 cols 2731 entries
Finished phase 1 with 142 SingleSign rule and 204 generalized
[2026-05-22 17:17:21] [INFO ] Computed 73 invariants in 4 ms
Computed 73 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1181443322680831769.kers
Total runtime 6 ms.
[2026-05-22 17:17:22] [INFO ] Implicit Places using invariants in 648 ms returned [1, 19, 20, 23, 33, 69, 198, 203, 215, 220, 221, 222, 257, 259, 262, 280, 281, 282, 283, 300, 308, 316, 322, 328, 334, 340, 348, 354, 360, 368]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 683 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 389/431 places, 716/728 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 376 transition count 703
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 376 transition count 703
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 366 transition count 693
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 366 transition count 693
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 361 transition count 688
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 361 transition count 688
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 359 transition count 686
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 359 transition count 686
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 357 transition count 684
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 357 transition count 684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 356 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 356 transition count 683
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 355 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 355 transition count 682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 354 transition count 681
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 354 transition count 681
Applied a total of 70 rules in 85 ms. Remains 354 /389 variables (removed 35) and now considering 681/716 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10847115678876168100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17855130333103219836.kers'
[2026-05-22 17:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10847115678876168100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17855130333103219836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 681 rows 354 cols 2458 entries
Finished phase 1 with 213 SingleSign rule and 98 generalized
[2026-05-22 17:17:22] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17855130333103219836.kers
Total runtime 4 ms.
[2026-05-22 17:17:22] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-22 17:17:22] [INFO ] Invariant cache hit.
[2026-05-22 17:17:23] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 354/431 places, 681/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2051 ms. Remains : 354/431 places, 681/728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 681/681 transitions.
Applied a total of 0 rules in 16 ms. Remains 354 /354 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2026-05-22 17:17:23] [INFO ] Invariant cache hit.
[2026-05-22 17:17:23] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-22 17:17:23] [INFO ] Invariant cache hit.
[2026-05-22 17:17:24] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2026-05-22 17:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1035 variables, and 50 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/354 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 680 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Problem TDEAD539 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 7/50 constraints. Problems are: Problem set: 5 solved, 675 unsolved
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/51 constraints. Problems are: Problem set: 9 solved, 671 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/1035 variables, and 51 constraints, problems are : Problem set: 9 solved, 671 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/354 constraints, PredecessorRefiner: 0/680 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60430ms problems are : Problem set: 9 solved, 671 unsolved
Search for dead transitions found 9 dead transitions in 60460ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 354/354 places, 672/681 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61576 ms. Remains : 354/354 places, 672/681 transitions.
Support contains 44 out of 354 places after structural reductions.
[2026-05-22 17:18:25] [INFO ] Flatten gal took : 82 ms
[2026-05-22 17:18:25] [INFO ] Flatten gal took : 43 ms
[2026-05-22 17:18:25] [INFO ] Input system was already deterministic with 672 transitions.
RANDOM walk for 40000 steps (758 resets) in 1704 ms. (23 steps per ms) remains 14/29 properties
BEST_FIRST walk for 40002 steps (284 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (289 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (278 resets) in 291 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (292 resets) in 197 ms. (202 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (304 resets) in 225 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (279 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (292 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (275 resets) in 188 ms. (211 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (288 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (281 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (292 resets) in 148 ms. (268 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (279 resets) in 203 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (268 resets) in 148 ms. (268 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (270 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7294814365504759824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8699153669077746996.kers'
[2026-05-22 17:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7294814365504759824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8699153669077746996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 354 cols 2431 entries
Finished phase 1 with 212 SingleSign rule and 98 generalized
[2026-05-22 17:18:26] [INFO ] Computed 44 invariants in 3 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8699153669077746996.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 192/335 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 19/354 variables, 5/44 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 672/1026 variables, 354/398 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1026 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/1026 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 398 constraints, problems are : Problem set: 1 solved, 13 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 30/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 88/141 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 194/335 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 19/354 variables, 5/45 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 11 (OVERLAPS) 672/1026 variables, 354/400 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1026 variables, 2/402 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1026 variables, 0/402 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1026 variables, 0/402 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 402 constraints, problems are : Problem set: 12 solved, 2 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 2/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5060ms problems are : Problem set: 12 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 302 ms.
Support contains 4 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 672/672 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 354 transition count 623
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 305 transition count 623
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 98 place count 305 transition count 583
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 93 rules applied. Total rules applied 191 place count 252 transition count 583
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 205 place count 247 transition count 574
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 214 place count 238 transition count 574
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 214 place count 238 transition count 570
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 234 transition count 570
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 227 place count 229 transition count 565
Iterating global reduction 4 with 5 rules applied. Total rules applied 232 place count 229 transition count 565
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 236 place count 229 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 228 transition count 561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 237 place count 228 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 227 transition count 560
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 293 place count 200 transition count 533
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 200 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 295 place count 199 transition count 532
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 298 place count 199 transition count 529
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 302 place count 195 transition count 529
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 303 place count 195 transition count 528
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 304 place count 195 transition count 528
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 305 place count 194 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 306 place count 193 transition count 527
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 306 place count 193 transition count 525
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 311 place count 190 transition count 525
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 312 place count 189 transition count 524
Iterating global reduction 9 with 1 rules applied. Total rules applied 313 place count 189 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 314 place count 189 transition count 523
Applied a total of 314 rules in 180 ms. Remains 189 /354 variables (removed 165) and now considering 523/672 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 189/354 places, 523/672 transitions.
RANDOM walk for 40000 steps (1086 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (600 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (585 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3656 steps, run visited all 2 properties in 83 ms. (steps per millisecond=44 )
Probabilistic random walk after 3656 steps, saw 2285 distinct states, run finished after 87 ms. (steps per millisecond=42 ) properties seen :2
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-01a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-01a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U X(!p1))&&X(F(p2))))'
Support contains 8 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2026-05-22 17:18:33] [INFO ] Invariant cache hit.
[2026-05-22 17:18:33] [INFO ] Implicit Places using invariants in 302 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 353 /353 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 315 ms. Remains : 353/354 places, 672/672 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) U X(!p1))&&X(F(p2))))'
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p2) p1), (NOT p2), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-02
Stuttering criterion allowed to conclude after 68 steps with 1 reset in 6 ms.
FORMULA ASLink-PT-01a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-02 finished in 914 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' '!((!p0 U G(p0)))'
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 353 transition count 622
Reduce places removed 50 places and 0 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 1 with 51 rules applied. Total rules applied 100 place count 303 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 302 transition count 621
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 101 place count 302 transition count 579
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 198 place count 247 transition count 579
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 17 rules applied. Total rules applied 215 place count 241 transition count 568
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 226 place count 230 transition count 568
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 226 place count 230 transition count 564
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 234 place count 226 transition count 564
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 240 place count 220 transition count 558
Iterating global reduction 5 with 6 rules applied. Total rules applied 246 place count 220 transition count 558
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 with 5 rules applied. Total rules applied 251 place count 220 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 252 place count 219 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 252 place count 219 transition count 552
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 254 place count 218 transition count 552
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 306 place count 192 transition count 526
Applied a total of 306 rules in 81 ms. Remains 192 /354 variables (removed 162) and now considering 526/672 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12658573655456831129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17790352989744923849.kers'
[2026-05-22 17:18:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12658573655456831129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17790352989744923849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 526 rows 192 cols 2101 entries
Finished phase 1 with 68 SingleSign rule and 100 generalized
[2026-05-22 17:18:33] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17790352989744923849.kers
Total runtime 3 ms.
[2026-05-22 17:18:34] [INFO ] Implicit Places using invariants in 245 ms returned [37, 72, 93, 101, 107, 109, 189]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 248 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/354 places, 526/672 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 185 transition count 521
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 180 transition count 521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 178 transition count 519
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 178 transition count 519
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 176 transition count 517
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 176 transition count 517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 175 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 175 transition count 516
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 169 transition count 510
Applied a total of 32 rules in 22 ms. Remains 169 /185 variables (removed 16) and now considering 510/526 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2325568560541281296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6723008878126467152.kers'
[2026-05-22 17:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2325568560541281296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6723008878126467152.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 169 cols 2044 entries
Finished phase 1 with 68 SingleSign rule and 84 generalized
[2026-05-22 17:18:34] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6723008878126467152.kers
Total runtime 2 ms.
[2026-05-22 17:18:34] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-22 17:18:34] [INFO ] Invariant cache hit.
[2026-05-22 17:18:34] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 169/354 places, 510/672 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 878 ms. Remains : 169/354 places, 510/672 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' '!((!p0 U G(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-05 finished in 999 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((F(p0)||X((!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (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-16824958357301383552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8230294422552733139.kers'
[2026-05-22 17:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16824958357301383552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8230294422552733139.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 354 cols 2431 entries
Finished phase 1 with 212 SingleSign rule and 98 generalized
[2026-05-22 17:18:34] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8230294422552733139.kers
Total runtime 4 ms.
[2026-05-22 17:18:35] [INFO ] Implicit Places using invariants in 298 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 672/672 transitions.
Applied a total of 0 rules in 4 ms. Remains 353 /353 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 353/354 places, 672/672 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((F(p0)||X((!p1 U (p2||G(!p1))))))))'
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 311 ms.
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 26 ms. Proved property starting from automaton with 5 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA ASLink-PT-01a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01a-LTLFireability-06 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2026-05-22 17:18:35] [INFO ] Invariant cache hit.
[2026-05-22 17:18:36] [INFO ] Implicit Places using invariants in 356 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 353 /353 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 353/354 places, 672/672 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((F(p0)||p1)))'
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-10 finished in 555 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(G(p0))))'
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2026-05-22 17:18:36] [INFO ] Invariant cache hit.
[2026-05-22 17:18:36] [INFO ] Implicit Places using invariants in 298 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 353/354 places, 672/672 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(G(p0))))'
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-11 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2026-05-22 17:18:37] [INFO ] Invariant cache hit.
[2026-05-22 17:18:37] [INFO ] Implicit Places using invariants in 322 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 672/672 transitions.
Applied a total of 0 rules in 3 ms. Remains 353 /353 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 353/354 places, 672/672 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((!p0 U (G(!p0)||p1))))'
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 9 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 14 ms.
FORMULA ASLink-PT-01a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01a-LTLFireability-13 finished in 1066 ms.
All properties solved by simple procedures.
Total runtime 77015 ms.

BK_STOP 1779470318166

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

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