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.r034-tall-177946841800164.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 BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.0K Mar 5 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 5 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 5 08:03 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 4.8K Mar 15 07:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 5 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K Mar 5 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779530046197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 09:54:07] [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-23 09:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:54:07] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2026-05-23 09:54:07] [INFO ] Transformed 28 places.
[2026-05-23 09:54:07] [INFO ] Transformed 52 transitions.
[2026-05-23 09:54:07] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 15 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2026-05-23 09:54:07] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1841677869453254496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6068933952432912761.kers'
[2026-05-23 09:54:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1841677869453254496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6068933952432912761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 26 cols 148 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-23 09:54:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6068933952432912761.kers
Total runtime 3 ms.
[2026-05-23 09:54:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/33 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 39 constraints, problems are : Problem set: 10 solved, 39 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/33 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 39/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/78 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 78 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2123ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2135ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2026-05-23 09:54:09] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12087384646553920386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17306052970990427742.kers'
[2026-05-23 09:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12087384646553920386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17306052970990427742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 26 cols 136 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-23 09:54:09] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17306052970990427742.kers
Total runtime 0 ms.
[2026-05-23 09:54:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 09:54:09] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:09] [INFO ] Invariant cache hit.
[2026-05-23 09:54:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:54:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 42/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2288 ms. Remains : 26/28 places, 42/52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:54:09] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:09] [INFO ] Invariant cache hit.
[2026-05-23 09:54:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1397ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1397ms
[2026-05-23 09:54:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:11] [INFO ] Invariant cache hit.
[2026-05-23 09:54:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 09:54:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:11] [INFO ] Invariant cache hit.
[2026-05-23 09:54:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:54:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1476 ms. Remains : 26/26 places, 42/42 transitions.
Support contains 26 out of 26 places after structural reductions.
[2026-05-23 09:54:11] [INFO ] Flatten gal took : 20 ms
[2026-05-23 09:54:11] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:54:11] [INFO ] Input system was already deterministic with 42 transitions.
Reduction of identical properties reduced properties to check from 26 to 24
RANDOM walk for 40001 steps (917 resets) in 1128 ms. (35 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40000 steps (454 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (348 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (392 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
[2026-05-23 09:54:12] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:12] [INFO ] Invariant cache hit.
[2026-05-23 09:54:12] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/21 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 21/56 variables, and 7 constraints, problems are : Problem set: 3 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/26 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(X(X((X((!p2 U (X(!p3)||G(!p2))))&&p1))))))))'
Support contains 12 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 09:54:12] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:54:12] [INFO ] Invariant cache hit.
[2026-05-23 09:54:12] [INFO ] Implicit Places using invariants in 34 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 24/26 places, 42/42 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(X(X((X((!p2 U (X(!p3)||G(!p2))))&&p1))))))))'
Stuttering acceptance computed with spot in 1736 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (OR (AND (NOT p0) p3) (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p3) (AND p2 p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-00
Product exploration explored 100000 steps with 6472 reset in 337 ms.
Product exploration explored 100000 steps with 6548 reset in 220 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Computed a total of 15 stabilizing places and 18 stable transitions
Detected a total of 15/24 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge based reduction with 6 factoid took 421 ms. Reduced automaton from 33 states, 131 edges and 4 AP (stutter sensitive) to 33 states, 131 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 30 to 18
RANDOM walk for 40000 steps (917 resets) in 538 ms. (74 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40002 steps (457 resets) in 300 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (426 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (358 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (332 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (353 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (385 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (354 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
[2026-05-23 09:54:16] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-177403565061150531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10689589150916389439.kers'
[2026-05-23 09:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-177403565061150531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10689589150916389439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 24 cols 120 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-23 09:54:16] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10689589150916389439.kers
Total runtime 0 ms.
[2026-05-23 09:54:16] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf26 is UNSAT
Problem apf27 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/23 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 30/53 variables, 23/28 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 4/32 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/54 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 33 constraints, problems are : Problem set: 4 solved, 3 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/23 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 30/53 variables, 23/28 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 4/32 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 3/35 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/36 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 36 constraints, problems are : Problem set: 4 solved, 3 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 4 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 42/42 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 41
Applied a total of 2 rules in 6 ms. Remains 23 /24 variables (removed 1) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2026-05-23 09:54:16] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8021856831972577572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-698605311793524166.kers'
[2026-05-23 09:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8021856831972577572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-698605311793524166.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 105 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-23 09:54:16] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-698605311793524166.kers
Total runtime 0 ms.
[2026-05-23 09:54:16] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 34 constraints, problems are : Problem set: 0 solved, 38 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1634ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 23/24 places, 41/42 transitions.
RANDOM walk for 40000 steps (1022 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (421 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (391 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (416 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
Probably explored full state space saw : 2246 states, properties seen :0
Probabilistic random walk after 7616 steps, saw 2246 distinct states, run finished after 39 ms. (steps per millisecond=195 ) properties seen :0
Explored full state space saw : 2246 states, properties seen :0
Exhaustive walk after 7616 steps, saw 2246 distinct states, run finished after 39 ms. (steps per millisecond=195 ) properties seen :0
Found 10 invariant AP formulas.
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(p0&&!p1&&p2&&!p3)' '--given-formula=X(p0)' '--given-formula=X(X(p0))' '--given-formula=F((G(p0)||G(!p0)))' '--given-formula=F((G(p1)||G(!p1)))' '--given-formula=F((G(p2)||G(!p2)))' '--given-formula=G((!p0||!p1||!p2||!p3))' '--given-formula=G((p0||!p1||!p2))' '--given-formula=G((!p0||!p1||!p2))' '--given-formula=G((p0||!p1||!p3))' '--given-formula=G((p0||p1||!p2||!p3))' '--given-formula=G((p0||!p1||!p2||!p3))' '--given-formula=G((p0||p1||!p3))' '--given-formula=G((p0||!p3))' '--given-formula=G((p0||p2||!p3))' '--given-formula=G((p0||!p2||!p3))' '-F' '/tmp/b4k2685658772843209107.hoa' '--given-strategy=auto-si' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(p0&&!p1&&p2&&!p3)' '--given-formula=X(p0)' '--given-formula=X(X(p0))' '--given-formula=F((G(p0)||G(!p0)))' '--given-formula=F((G(p1)||G(!p1)))' '--given-formula=F((G(p2)||G(!p2)))' '--given-formula=G((!p0||!p1||!p2||!p3))' '--given-formula=G((p0||!p1||!p2))' '--given-formula=G((!p0||!p1||!p2))' '--given-formula=G((p0||!p1||!p3))' '--given-formula=G((p0||p1||!p2||!p3))' '--given-formula=G((p0||!p1||!p2||!p3))' '--given-formula=G((p0||p1||!p3))' '--given-formula=G((p0||!p3))' '--given-formula=G((p0||p2||!p3))' '--given-formula=G((p0||!p2||!p3))' '-F' '/tmp/b4k2617098565731511047.hoa' '--given-strategy=auto-small' killed by timeout after 10 SECONDS
Knowledge-based reduction took 24870 ms.
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 finished in 27391 ms.
Application raised an uncaught exception Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
java.lang.NullPointerException: Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeReducer.integrateKnowledge(KnowledgeReducer.java:34)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:49)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
Total runtime 32801 ms.

BK_STOP 1779530080126

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r034-tall-177946841800164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 ;