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.r018-smll-177946788000236.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 BART-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 450K Mar 5 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Mar 5 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 690K Mar 5 09:22 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 309K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 832K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 141K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 372K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 501K Mar 5 09:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 553K Mar 5 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 36K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 74K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 1.3M 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 BART-PT-005-LTLFireability-00
FORMULA_NAME BART-PT-005-LTLFireability-01
FORMULA_NAME BART-PT-005-LTLFireability-02
FORMULA_NAME BART-PT-005-LTLFireability-03
FORMULA_NAME BART-PT-005-LTLFireability-04
FORMULA_NAME BART-PT-005-LTLFireability-05
FORMULA_NAME BART-PT-005-LTLFireability-06
FORMULA_NAME BART-PT-005-LTLFireability-07
FORMULA_NAME BART-PT-005-LTLFireability-08
FORMULA_NAME BART-PT-005-LTLFireability-09
FORMULA_NAME BART-PT-005-LTLFireability-10
FORMULA_NAME BART-PT-005-LTLFireability-11
FORMULA_NAME BART-PT-005-LTLFireability-12
FORMULA_NAME BART-PT-005-LTLFireability-13
FORMULA_NAME BART-PT-005-LTLFireability-14
FORMULA_NAME BART-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779550218997

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 15:30: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-23 15:30:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:30:21] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2026-05-23 15:30:21] [INFO ] Transformed 870 places.
[2026-05-23 15:30:21] [INFO ] Transformed 1010 transitions.
[2026-05-23 15:30:21] [INFO ] Found NUPN structural information;
[2026-05-23 15:30:22] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 700 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 65 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 25 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (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-9165226435226597879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2570174696927565359.kers'
[2026-05-23 15:30:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9165226435226597879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2570174696927565359.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1010 rows 660 cols 2020 entries
Finished phase 1 with 655 SingleSign rule and 0 generalized
[2026-05-23 15:30:22] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2570174696927565359.kers
Total runtime 6 ms.
[2026-05-23 15:30:23] [INFO ] Implicit Places using invariants in 637 ms returned []
[2026-05-23 15:30:23] [INFO ] Invariant cache hit.
[2026-05-23 15:30:24] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2026-05-23 15:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30069 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30048 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60828ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60920ms
Finished structural reductions in LTL mode , in 1 iterations and 63024 ms. Remains : 660/660 places, 1010/1010 transitions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:31:25] [INFO ] Invariant cache hit.
[2026-05-23 15:31:25] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-23 15:31:25] [INFO ] Invariant cache hit.
[2026-05-23 15:31:26] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1014 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2026-05-23 15:31:27] [INFO ] Flatten gal took : 198 ms
[2026-05-23 15:31:27] [INFO ] Flatten gal took : 88 ms
[2026-05-23 15:31:27] [INFO ] Input system was already deterministic with 1010 transitions.
Reduction of identical properties reduced properties to check from 18 to 15
RANDOM walk for 8014 steps (1 resets) in 381 ms. (20 steps per ms) remains 0/15 properties
Computed a total of 0 stabilizing places and 0 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((!(p0 U p1)||X(p0)))&&G(X(p1))))'
Support contains 385 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 45 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:31:28] [INFO ] Invariant cache hit.
[2026-05-23 15:31:28] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-23 15:31:28] [INFO ] Invariant cache hit.
[2026-05-23 15:31:29] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1112 ms. Remains : 660/660 places, 1010/1010 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!(p0 U p1)||X(p0)))&&G(X(p1))))'
Stuttering acceptance computed with spot in 429 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-005-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA BART-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-01 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||X(X((p2||G(p3))))))'
Support contains 390 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:31:29] [INFO ] Invariant cache hit.
[2026-05-23 15:31:30] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-23 15:31:30] [INFO ] Invariant cache hit.
[2026-05-23 15:31:31] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1168 ms. Remains : 660/660 places, 1010/1010 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 p1)||X(X((p2||G(p3))))))'
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BART-PT-005-LTLFireability-03
Product exploration explored 100000 steps with 9984 reset in 1481 ms.
Product exploration explored 100000 steps with 9915 reset in 1342 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 9 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 96 steps (0 resets) in 11 ms. (8 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 324 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Knowledge-based reduction took 1278 ms.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 50 out of 660 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 21 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:31:35] [INFO ] Invariant cache hit.
[2026-05-23 15:31:36] [INFO ] Implicit Places using invariants in 278 ms returned []
[2026-05-23 15:31:36] [INFO ] Invariant cache hit.
[2026-05-23 15:31:36] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1113 ms. Remains : 660/660 places, 1010/1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 98 steps (0 resets) in 10 ms. (8 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Knowledge-based reduction took 499 ms.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 5468 reset in 1019 ms.
Product exploration explored 100000 steps with 5504 reset in 1007 ms.
Spot run failed in 255 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15684812541808930398
[2026-05-23 15:31:40] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15684812541808930398
Running compilation step : cd /tmp/ltsmin15684812541808930398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15684812541808930398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15684812541808930398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 50 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 115 place count 545 transition count 895
Iterating global reduction 0 with 115 rules applied. Total rules applied 230 place count 545 transition count 895
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 325 place count 450 transition count 800
Iterating global reduction 0 with 95 rules applied. Total rules applied 420 place count 450 transition count 800
Applied a total of 420 rules in 79 ms. Remains 450 /660 variables (removed 210) and now considering 800/1010 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8315672258354794637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15876333207934418837.kers'
[2026-05-23 15:31:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8315672258354794637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15876333207934418837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 800 rows 450 cols 1600 entries
Finished phase 1 with 445 SingleSign rule and 0 generalized
[2026-05-23 15:31:43] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15876333207934418837.kers
Total runtime 6 ms.
[2026-05-23 15:31:43] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-23 15:31:43] [INFO ] Invariant cache hit.
[2026-05-23 15:31:44] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-23 15:31:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1250 variables, and 5 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/1250 variables, and 5 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 0/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 450/660 places, 800/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 450/660 places, 800/1010 transitions.
Built C files in :
/tmp/ltsmin4806590973410266106
[2026-05-23 15:32:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4806590973410266106
Running compilation step : cd /tmp/ltsmin4806590973410266106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2067 ms.
Running link step : cd /tmp/ltsmin4806590973410266106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4806590973410266106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15882602913343631262.hoa' '--buchi-type=spotba'
LTSmin run took 579 ms.
FORMULA BART-PT-005-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-005-LTLFireability-03 finished in 77152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 340 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 660 transition count 995
Reduce places removed 15 places and 0 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Iterating post reduction 1 with 150 rules applied. Total rules applied 165 place count 645 transition count 860
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 300 place count 510 transition count 860
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 305 place count 505 transition count 855
Iterating global reduction 3 with 5 rules applied. Total rules applied 310 place count 505 transition count 855
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 350 place count 485 transition count 835
Applied a total of 350 rules in 131 ms. Remains 485 /660 variables (removed 175) and now considering 835/1010 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12517260388046629305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4905879291238622411.kers'
[2026-05-23 15:32:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12517260388046629305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4905879291238622411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 835 rows 485 cols 1670 entries
Finished phase 1 with 480 SingleSign rule and 0 generalized
[2026-05-23 15:32:47] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4905879291238622411.kers
Total runtime 5 ms.
[2026-05-23 15:32:47] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-23 15:32:47] [INFO ] Invariant cache hit.
[2026-05-23 15:32:47] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2026-05-23 15:32:47] [INFO ] Redundant transitions in 61 ms returned []
Running 655 sub problems to find dead transitions.
[2026-05-23 15:32:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 5/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1320 variables, and 5 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 5/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1320 variables, and 5 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 0/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 485/660 places, 835/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60976 ms. Remains : 485/660 places, 835/1010 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1815 ms.
Product exploration explored 100000 steps with 50000 reset in 1881 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 48 ms.
FORMULA BART-PT-005-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-005-LTLFireability-04 finished in 64825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((G(F(p1)) U p0) U X(X(G(p2))))))'
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 5 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (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-17307942264705026680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9083061535170753811.kers'
[2026-05-23 15:33:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17307942264705026680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9083061535170753811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1010 rows 660 cols 2020 entries
Finished phase 1 with 655 SingleSign rule and 0 generalized
[2026-05-23 15:33:51] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9083061535170753811.kers
Total runtime 8 ms.
[2026-05-23 15:33:52] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-23 15:33:52] [INFO ] Invariant cache hit.
[2026-05-23 15:33:53] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2026-05-23 15:33:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30038 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30044 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Finished structural reductions in LTL mode , in 1 iterations and 61290 ms. Remains : 660/660 places, 1010/1010 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)&&((G(F(p1)) U p0) U X(X(G(p2))))))'
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-05
Product exploration explored 100000 steps with 3192 reset in 1080 ms.
Product exploration explored 100000 steps with 3233 reset in 1041 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 108 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/6 properties
Knowledge based reduction with 3 factoid took 324 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
[2026-05-23 15:34:56] [INFO ] Invariant cache hit.
[2026-05-23 15:34:57] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2026-05-23 15:34:58] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2026-05-23 15:34:58] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints (skipped 0 transitions) in 110 ms.
[2026-05-23 15:34:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 15:34:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-23 15:34:59] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2026-05-23 15:34:59] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints (skipped 0 transitions) in 108 ms.
Could not prove EG (NOT p2)
[2026-05-23 15:35:13] [INFO ] Invariant cache hit.
[2026-05-23 15:35:21] [INFO ] [Real]Absence check using 5 positive place invariants in 210 ms returned sat
[2026-05-23 15:35:28] [INFO ] [Real]Absence check using state equation in 7569 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 32854 ms.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 9 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:35:29] [INFO ] Invariant cache hit.
[2026-05-23 15:35:29] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-23 15:35:29] [INFO ] Invariant cache hit.
[2026-05-23 15:35:30] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 660/660 places, 1010/1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 119 steps (0 resets) in 8 ms. (13 steps per ms) remains 0/6 properties
Knowledge based reduction with 3 factoid took 332 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
[2026-05-23 15:35:31] [INFO ] Invariant cache hit.
[2026-05-23 15:35:32] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2026-05-23 15:35:32] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2026-05-23 15:35:32] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints (skipped 0 transitions) in 106 ms.
[2026-05-23 15:35:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 15:35:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2026-05-23 15:35:34] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2026-05-23 15:35:34] [INFO ] Computed and/alt/rep : 830/1350/830 causal constraints (skipped 0 transitions) in 71 ms.
Could not prove EG (NOT p2)
[2026-05-23 15:35:48] [INFO ] Invariant cache hit.
[2026-05-23 15:35:56] [INFO ] [Real]Absence check using 5 positive place invariants in 207 ms returned sat
[2026-05-23 15:36:03] [INFO ] [Real]Absence check using state equation in 6720 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 32992 ms.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 3222 reset in 1042 ms.
Product exploration explored 100000 steps with 3305 reset in 874 ms.
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1359151112885587403
[2026-05-23 15:36:06] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1359151112885587403
Running compilation step : cd /tmp/ltsmin1359151112885587403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2632 ms.
Running link step : cd /tmp/ltsmin1359151112885587403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin1359151112885587403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11388242616870871960.hoa' '--buchi-type=spotba'
LTSmin run took 1410 ms.
FORMULA BART-PT-005-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-005-LTLFireability-05 finished in 138413 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(F(p0)) U G(p1))&&X(X(X((p2&&F(p3)))))))'
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 4 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:36:10] [INFO ] Invariant cache hit.
[2026-05-23 15:36:10] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 15:36:10] [INFO ] Invariant cache hit.
[2026-05-23 15:36:11] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 876 ms. Remains : 660/660 places, 1010/1010 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)) U G(p1))&&X(X(X((p2&&F(p3)))))))'
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : BART-PT-005-LTLFireability-06
Entered a terminal (fully accepting) state of product in 143 steps with 4 reset in 2 ms.
FORMULA BART-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-06 finished in 1183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 10 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 660 transition count 690
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 640 place count 340 transition count 690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 640 place count 340 transition count 670
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 710 place count 290 transition count 640
Iterating global reduction 2 with 30 rules applied. Total rules applied 740 place count 290 transition count 640
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 745 place count 290 transition count 635
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 765 place count 270 transition count 615
Iterating global reduction 3 with 20 rules applied. Total rules applied 785 place count 270 transition count 615
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 800 place count 255 transition count 600
Iterating global reduction 3 with 15 rules applied. Total rules applied 815 place count 255 transition count 600
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 830 place count 240 transition count 585
Iterating global reduction 3 with 15 rules applied. Total rules applied 845 place count 240 transition count 585
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 855 place count 230 transition count 575
Iterating global reduction 3 with 10 rules applied. Total rules applied 865 place count 230 transition count 575
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 875 place count 220 transition count 565
Iterating global reduction 3 with 10 rules applied. Total rules applied 885 place count 220 transition count 565
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 215 transition count 560
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 215 transition count 560
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 965 place count 180 transition count 525
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 985 place count 180 transition count 505
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1005 place count 170 transition count 495
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1025 place count 170 transition count 475
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1045 place count 160 transition count 465
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1065 place count 160 transition count 445
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1085 place count 150 transition count 435
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1105 place count 150 transition count 415
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1125 place count 140 transition count 405
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1145 place count 140 transition count 385
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1165 place count 130 transition count 375
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1185 place count 130 transition count 355
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1205 place count 120 transition count 345
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1225 place count 120 transition count 325
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1245 place count 110 transition count 315
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1265 place count 110 transition count 295
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1285 place count 100 transition count 285
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1305 place count 100 transition count 265
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1325 place count 90 transition count 255
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 1345 place count 90 transition count 235
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1365 place count 80 transition count 225
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 1385 place count 80 transition count 205
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 1405 place count 70 transition count 195
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 1425 place count 70 transition count 175
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 1445 place count 60 transition count 165
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1465 place count 60 transition count 145
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 1485 place count 50 transition count 135
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1505 place count 50 transition count 115
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 1525 place count 40 transition count 105
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 17 with 20 rules applied. Total rules applied 1545 place count 40 transition count 85
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 18 with 20 rules applied. Total rules applied 1565 place count 30 transition count 75
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 1585 place count 30 transition count 55
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 1605 place count 20 transition count 45
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 19 with 25 rules applied. Total rules applied 1630 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1640 place count 15 transition count 15
Applied a total of 1640 rules in 219 ms. Remains 15 /660 variables (removed 645) and now considering 15/1010 (removed 995) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8854290997132072084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-193012591962418005.kers'
[2026-05-23 15:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8854290997132072084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-193012591962418005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 15 cols 30 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-23 15:36:11] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-193012591962418005.kers
Total runtime 1 ms.
[2026-05-23 15:36:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 15:36:11] [INFO ] Invariant cache hit.
[2026-05-23 15:36:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-23 15:36:11] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-23 15:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/660 places, 15/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 672 ms. Remains : 15/660 places, 15/1010 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((G(p0)||p1))))'
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-005-LTLFireability-07
Product exploration explored 100000 steps with 2296 reset in 285 ms.
Stack based approach found an accepted trace after 380 steps with 4 reset with depth 32 and stack size 30 in 2 ms.
FORMULA BART-PT-005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-07 finished in 1060 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) U !p0)&&(p2 U X(p3)))))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 449 place count 369 transition count 719
Iterating global reduction 0 with 133 rules applied. Total rules applied 582 place count 369 transition count 719
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 601 place count 350 transition count 700
Iterating global reduction 0 with 19 rules applied. Total rules applied 620 place count 350 transition count 700
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 634 place count 336 transition count 686
Iterating global reduction 0 with 14 rules applied. Total rules applied 648 place count 336 transition count 686
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 662 place count 322 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 676 place count 322 transition count 672
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 690 place count 308 transition count 658
Iterating global reduction 0 with 14 rules applied. Total rules applied 704 place count 308 transition count 658
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 717 place count 295 transition count 645
Iterating global reduction 0 with 13 rules applied. Total rules applied 730 place count 295 transition count 645
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 743 place count 282 transition count 632
Iterating global reduction 0 with 13 rules applied. Total rules applied 756 place count 282 transition count 632
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 765 place count 273 transition count 623
Iterating global reduction 0 with 9 rules applied. Total rules applied 774 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 782 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 790 place count 265 transition count 615
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 794 place count 261 transition count 611
Iterating global reduction 0 with 4 rules applied. Total rules applied 798 place count 261 transition count 611
Applied a total of 798 rules in 97 ms. Remains 261 /660 variables (removed 399) and now considering 611/1010 (removed 399) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11725587672157318561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-428309720931015220.kers'
[2026-05-23 15:36:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11725587672157318561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-428309720931015220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 611 rows 261 cols 1222 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 15:36:12] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-428309720931015220.kers
Total runtime 6 ms.
[2026-05-23 15:36:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 15:36:12] [INFO ] Invariant cache hit.
[2026-05-23 15:36:13] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-23 15:36:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/872 variables, and 266 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 431/697 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 697 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 261/660 places, 611/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 261/660 places, 611/1010 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 p1) U !p0)&&(p2 U X(p3)))))'
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p3) p0), (OR (NOT p3) p0), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (NOT p3), true]
Running random walk in product with property : BART-PT-005-LTLFireability-08
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-08 finished in 60969 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(F((p0&&F(p1)))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 59 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10853192117842406630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14795616524151063641.kers'
[2026-05-23 15:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10853192117842406630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14795616524151063641.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 595 rows 245 cols 1190 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 15:37:13] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14795616524151063641.kers
Total runtime 5 ms.
[2026-05-23 15:37:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-23 15:37:13] [INFO ] Invariant cache hit.
[2026-05-23 15:37:14] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2026-05-23 15:37:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 245/660 places, 595/1010 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&&F(p1)))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-005-LTLFireability-09
Product exploration explored 100000 steps with 1776 reset in 357 ms.
Stack based approach found an accepted trace after 37294 steps with 674 reset with depth 45 and stack size 45 in 142 ms.
FORMULA BART-PT-005-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-09 finished in 61303 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(G((G(p1)||X(X(p2))||p0))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 106 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
[2026-05-23 15:38:14] [INFO ] Invariant cache hit.
[2026-05-23 15:38:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 15:38:15] [INFO ] Invariant cache hit.
[2026-05-23 15:38:15] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 245/660 places, 595/1010 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(G((G(p1)||X(X(p2))||p0))))'
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BART-PT-005-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-10 finished in 1025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(p1||X(F((p1&&F(!p1))))))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 935 edges and 660 vertex of which 396 / 660 are part of one of the 3 SCC in 7 ms
Free SCC test removed 393 places
Ensure Unique test removed 603 transitions
Reduce isomorphic transitions removed 603 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 264 transition count 277
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 259 place count 136 transition count 277
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 259 place count 136 transition count 268
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 127 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 289 place count 115 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 301 place count 115 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 303 place count 115 transition count 254
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 311 place count 107 transition count 246
Iterating global reduction 3 with 8 rules applied. Total rules applied 319 place count 107 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 325 place count 101 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 331 place count 101 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 337 place count 95 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 343 place count 95 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 347 place count 91 transition count 230
Iterating global reduction 3 with 4 rules applied. Total rules applied 351 place count 91 transition count 230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 355 place count 87 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 359 place count 87 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 361 place count 85 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 85 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 391 place count 71 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 399 place count 71 transition count 202
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 407 place count 67 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 415 place count 67 transition count 190
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 423 place count 63 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 431 place count 63 transition count 178
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 439 place count 59 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 447 place count 59 transition count 166
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 455 place count 55 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 463 place count 55 transition count 154
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 471 place count 51 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 479 place count 51 transition count 142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 487 place count 47 transition count 138
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 495 place count 47 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 503 place count 43 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 511 place count 43 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 519 place count 39 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 527 place count 39 transition count 106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 535 place count 35 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 543 place count 35 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 551 place count 31 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 559 place count 31 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 567 place count 27 transition count 78
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 575 place count 27 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 583 place count 23 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 591 place count 23 transition count 58
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 599 place count 19 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 607 place count 19 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 615 place count 15 transition count 42
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 623 place count 15 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 631 place count 11 transition count 30
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 639 place count 11 transition count 22
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 647 place count 7 transition count 18
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 19 with 10 rules applied. Total rules applied 657 place count 7 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 661 place count 5 transition count 6
Applied a total of 661 rules in 109 ms. Remains 5 /660 variables (removed 655) and now considering 6/1010 (removed 1004) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13684001078063431851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1727946806956608200.kers'
[2026-05-23 15:38:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13684001078063431851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1727946806956608200.kers]
Normalized transition count is 5 out of 6 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 8 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-23 15:38:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1727946806956608200.kers
Total runtime 1 ms.
[2026-05-23 15:38:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 15:38:16] [INFO ] Invariant cache hit.
[2026-05-23 15:38:16] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-23 15:38:16] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 15:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/660 places, 6/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 5/660 places, 6/1010 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((F(G(p0))&&(p1||X(F((p1&&F(!p1))))))))'
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-005-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-14 finished in 525 ms.
All properties solved by simple procedures.
Total runtime 475133 ms.

BK_STOP 1779550696449

--------------------
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="BART-PT-005"
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 BART-PT-005, 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 r018-smll-177946788000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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