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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 76M
-rw-r--r-- 1 mcc users 2.2M Mar 5 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Mar 5 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Mar 5 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.2M Mar 5 09:39 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 1.6M Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4M Mar 5 09:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.1M Mar 5 09:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2M Mar 5 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20M Mar 5 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 242K Mar 15 07:24 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 9.5M 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-040-LTLFireability-00
FORMULA_NAME BART-PT-040-LTLFireability-01
FORMULA_NAME BART-PT-040-LTLFireability-02
FORMULA_NAME BART-PT-040-LTLFireability-03
FORMULA_NAME BART-PT-040-LTLFireability-04
FORMULA_NAME BART-PT-040-LTLFireability-05
FORMULA_NAME BART-PT-040-LTLFireability-06
FORMULA_NAME BART-PT-040-LTLFireability-07
FORMULA_NAME BART-PT-040-LTLFireability-08
FORMULA_NAME BART-PT-040-LTLFireability-09
FORMULA_NAME BART-PT-040-LTLFireability-10
FORMULA_NAME BART-PT-040-LTLFireability-11
FORMULA_NAME BART-PT-040-LTLFireability-12
FORMULA_NAME BART-PT-040-LTLFireability-13
FORMULA_NAME BART-PT-040-LTLFireability-14
FORMULA_NAME BART-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779556188651

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-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 17:09:50] [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 17:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:09:51] [INFO ] Load time of PNML (sax parser for PT used): 1083 ms
[2026-05-23 17:09:51] [INFO ] Transformed 5490 places.
[2026-05-23 17:09:52] [INFO ] Transformed 8080 transitions.
[2026-05-23 17:09:52] [INFO ] Found NUPN structural information;
[2026-05-23 17:09:52] [INFO ] Parsed PT model containing 5490 places and 8080 transitions and 64800 arcs in 1332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 167 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5280 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 84 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (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-249006241558354345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16512638947200924496.kers'
[2026-05-23 17:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-249006241558354345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16512638947200924496.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 8080 rows 5280 cols 16160 entries
Finished phase 1 with 5240 SingleSign rule and 0 generalized
[2026-05-23 17:09:53] [INFO ] Computed 40 invariants in 44 ms
Computed 40 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-16512638947200924496.kers
Total runtime 54 ms.
[2026-05-23 17:09:56] [INFO ] Implicit Places using invariants in 2919 ms returned []
[2026-05-23 17:09:56] [INFO ] Invariant cache hit.
[2026-05-23 17:10:03] [INFO ] Implicit Places using invariants and state equation in 7303 ms returned []
Implicit Place search using SMT with State Equation took 10275 ms to find 0 implicit places.
Running 6640 sub problems to find dead transitions.
[2026-05-23 17:10:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/5240 variables, 5240/5240 constraints. Problems are: Problem set: 0 solved, 6640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5240/13360 variables, and 5240 constraints, problems are : Problem set: 0 solved, 6640 unsolved in 30270 ms.
Refiners :[Domain max(s): 5240/5280 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/5280 constraints, PredecessorRefiner: 6640/6640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5240 variables, 5240/5240 constraints. Problems are: Problem set: 0 solved, 6640 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5240/13360 variables, and 5240 constraints, problems are : Problem set: 0 solved, 6640 unsolved in 30222 ms.
Refiners :[Domain max(s): 5240/5280 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/5280 constraints, PredecessorRefiner: 0/6640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65916ms problems are : Problem set: 0 solved, 6640 unsolved
Search for dead transitions found 0 dead transitions in 65989ms
Finished structural reductions in LTL mode , in 1 iterations and 76633 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 72 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
[2026-05-23 17:11:10] [INFO ] Invariant cache hit.
[2026-05-23 17:11:11] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2026-05-23 17:11:11] [INFO ] Invariant cache hit.
[2026-05-23 17:11:19] [INFO ] Implicit Places using invariants and state equation in 7610 ms returned []
Implicit Place search using SMT with State Equation took 9531 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 9610 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Support contains 5280 out of 5280 places after structural reductions.
[2026-05-23 17:11:21] [INFO ] Flatten gal took : 532 ms
[2026-05-23 17:11:21] [INFO ] Flatten gal took : 426 ms
[2026-05-23 17:11:23] [INFO ] Input system was already deterministic with 8080 transitions.
Reduction of identical properties reduced properties to check from 27 to 23
RANDOM walk for 40000 steps (8 resets) in 2785 ms. (14 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4553 ms. (8 steps per ms) remains 1/1 properties
[2026-05-23 17:11:25] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/2760 variables, 2760/2760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2760 variables, 0/2760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2520/5280 variables, 40/2800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5280 variables, 2520/5320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5280 variables, 0/5320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5070ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2760 out of 5280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 5280 transition count 7960
Reduce places removed 120 places and 0 transitions.
Performed 1040 Post agglomeration using F-continuation condition.Transition count delta: 1040
Iterating post reduction 1 with 1160 rules applied. Total rules applied 1280 place count 5160 transition count 6920
Reduce places removed 1040 places and 0 transitions.
Iterating post reduction 2 with 1040 rules applied. Total rules applied 2320 place count 4120 transition count 6920
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2360 place count 4080 transition count 6880
Iterating global reduction 3 with 40 rules applied. Total rules applied 2400 place count 4080 transition count 6880
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 2720 place count 3920 transition count 6720
Drop transitions (Redundant composition of simpler transitions.) removed 1400 transitions
Redundant transition composition rules discarded 1400 transitions
Iterating global reduction 3 with 1400 rules applied. Total rules applied 4120 place count 3920 transition count 5320
Applied a total of 4120 rules in 1307 ms. Remains 3920 /5280 variables (removed 1360) and now considering 5320/8080 (removed 2760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1309 ms. Remains : 3920/5280 places, 5320/8080 transitions.
RANDOM walk for 40000 steps (8 resets) in 975 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13280 steps (0 resets) in 1364 ms. (9 steps per ms) remains 0/1 properties
FORMULA BART-PT-040-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((((G(p0) U p1)||F(p2)) U p2)))'
Support contains 360 out of 5280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 265 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
[2026-05-23 17:11:33] [INFO ] Invariant cache hit.
[2026-05-23 17:11:35] [INFO ] Implicit Places using invariants in 1843 ms returned []
[2026-05-23 17:11:35] [INFO ] Invariant cache hit.
[2026-05-23 17:11:41] [INFO ] Implicit Places using invariants and state equation in 6064 ms returned []
Implicit Place search using SMT with State Equation took 7912 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8183 ms. Remains : 5280/5280 places, 8080/8080 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(p0) U p1)||F(p2)) U p2)))'
Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-00
Product exploration explored 100000 steps with 1416 reset in 5695 ms.
Product exploration explored 100000 steps with 1404 reset in 5616 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 2 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 258 steps (0 resets) in 32 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2)]
[2026-05-23 17:11:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 18253 ms.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Support contains 360 out of 5280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Performed 920 Post agglomeration using F-continuation condition.Transition count delta: 920
Iterating post reduction 0 with 920 rules applied. Total rules applied 920 place count 5280 transition count 7160
Reduce places removed 920 places and 0 transitions.
Iterating post reduction 1 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Applied a total of 1840 rules in 626 ms. Remains 4360 /5280 variables (removed 920) and now considering 7160/8080 (removed 920) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13798180284160380415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1743413451533029796.kers'
[2026-05-23 17:12:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13798180284160380415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1743413451533029796.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 7160 rows 4360 cols 14320 entries
Finished phase 1 with 4320 SingleSign rule and 0 generalized
[2026-05-23 17:12:12] [INFO ] Computed 40 invariants in 47 ms
Computed 40 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-1743413451533029796.kers
Total runtime 58 ms.
[2026-05-23 17:12:13] [INFO ] Implicit Places using invariants in 1647 ms returned []
[2026-05-23 17:12:13] [INFO ] Invariant cache hit.
[2026-05-23 17:12:19] [INFO ] Implicit Places using invariants and state equation in 5769 ms returned []
Implicit Place search using SMT with State Equation took 7422 ms to find 0 implicit places.
[2026-05-23 17:12:21] [INFO ] Redundant transitions in 1349 ms returned []
Running 5720 sub problems to find dead transitions.
[2026-05-23 17:12:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4320 variables, 4320/4320 constraints. Problems are: Problem set: 0 solved, 5720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4320/11520 variables, and 4320 constraints, problems are : Problem set: 0 solved, 5720 unsolved in 30204 ms.
Refiners :[Domain max(s): 4320/4360 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/4360 constraints, PredecessorRefiner: 5720/5720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4320 variables, 4320/4320 constraints. Problems are: Problem set: 0 solved, 5720 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 4320/11520 variables, and 4320 constraints, problems are : Problem set: 0 solved, 5720 unsolved in 30124 ms.
Refiners :[Domain max(s): 4320/4360 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/4360 constraints, PredecessorRefiner: 0/5720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64419ms problems are : Problem set: 0 solved, 5720 unsolved
Search for dead transitions found 0 dead transitions in 64440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4360/5280 places, 7160/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73867 ms. Remains : 4360/5280 places, 7160/8080 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 2 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 250 steps (0 resets) in 24 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p2)]
[2026-05-23 17:13:28] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
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)
[2026-05-23 17:13:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Knowledge-based reduction took 18113 ms.
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1514 reset in 5698 ms.
Product exploration explored 100000 steps with 1507 reset in 5602 ms.
Built C files in :
/tmp/ltsmin15949561265979092007
[2026-05-23 17:13:55] [INFO ] Too many transitions (7160) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:13:55] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15949561265979092007
Running compilation step : cd /tmp/ltsmin15949561265979092007;'/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/ltsmin15949561265979092007;'/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/ltsmin15949561265979092007;'/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 360 out of 4360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4360/4360 places, 7160/7160 transitions.
Graph (trivial) has 6200 edges and 4360 vertex of which 1640 / 4360 are part of one of the 40 SCC in 13 ms
Free SCC test removed 1600 places
Ensure Unique test removed 3000 transitions
Reduce isomorphic transitions removed 3000 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1320 transitions
Trivial Post-agglo rules discarded 1320 transitions
Performed 1320 trivial Post agglomeration. Transition count delta: 1320
Iterating post reduction 0 with 1320 rules applied. Total rules applied 1321 place count 2760 transition count 2840
Reduce places removed 1320 places and 0 transitions.
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 1 with 1800 rules applied. Total rules applied 3121 place count 1440 transition count 2360
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 2 with 480 rules applied. Total rules applied 3601 place count 1280 transition count 2040
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 3 with 480 rules applied. Total rules applied 4081 place count 1120 transition count 1720
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 4 with 320 rules applied. Total rules applied 4401 place count 960 transition count 1560
Discarding 200 places :
Symmetric choice reduction at 5 with 200 rule applications. Total rules 4601 place count 760 transition count 1360
Iterating global reduction 5 with 200 rules applied. Total rules applied 4801 place count 760 transition count 1360
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 5001 place count 760 transition count 1160
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 5041 place count 760 transition count 1120
Applied a total of 5041 rules in 173 ms. Remains 760 /4360 variables (removed 3600) and now considering 1120/7160 (removed 6040) transitions.
[2026-05-23 17:13:58] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12885973977027852205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11124653453685794280.kers'
[2026-05-23 17:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12885973977027852205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11124653453685794280.kers]
Normalized transition count is 1080 out of 1081 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1080 rows 760 cols 2160 entries
Finished phase 1 with 720 SingleSign rule and 0 generalized
[2026-05-23 17:13:58] [INFO ] Computed 40 invariants in 11 ms
Computed 40 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11124653453685794280.kers
Total runtime 15 ms.
[2026-05-23 17:13:58] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-23 17:13:58] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2026-05-23 17:13:58] [INFO ] Invariant cache hit.
[2026-05-23 17:13:59] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2026-05-23 17:13:59] [INFO ] Redundant transitions in 93 ms returned []
Running 720 sub problems to find dead transitions.
[2026-05-23 17:13:59] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2026-05-23 17:13:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 720 unsolved
SMT process timed out in 30218ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in SI_LTL mode, iteration 1 : 760/4360 places, 1120/7160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31411 ms. Remains : 760/4360 places, 1120/7160 transitions.
Built C files in :
/tmp/ltsmin10856622388588645935
[2026-05-23 17:14:29] [INFO ] Computing symmetric may disable matrix : 1120 transitions.
[2026-05-23 17:14:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:14:29] [INFO ] Computing symmetric may enable matrix : 1120 transitions.
[2026-05-23 17:14:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:14:30] [INFO ] Computing Do-Not-Accords matrix : 1120 transitions.
[2026-05-23 17:14:30] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:14:30] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10856622388588645935
Running compilation step : cd /tmp/ltsmin10856622388588645935;'/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/ltsmin10856622388588645935;'/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/ltsmin10856622388588645935;'/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)
[2026-05-23 17:14:33] [INFO ] Flatten gal took : 33 ms
[2026-05-23 17:14:33] [INFO ] Flatten gal took : 32 ms
[2026-05-23 17:14:33] [INFO ] Time to serialize gal into /tmp/LTL14164863835231610714.gal : 18 ms
[2026-05-23 17:14:33] [INFO ] Time to serialize properties into /tmp/LTL616961322115368148.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14164863835231610714.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1358007919921880879.hoa' '-atoms' '/tmp/LTL616961322115368148.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL616961322115368148.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1358007919921880879.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
605 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.23266,130172,1,0,85,766026,23,40,17788,293652,217
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-040-LTLFireability-00 finished in 187470 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(p1)&&X(X(X(X(F(p2)))))&&p0)))'
Support contains 400 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 920 places :
Symmetric choice reduction at 0 with 920 rule applications. Total rules 920 place count 4360 transition count 7160
Iterating global reduction 0 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Discarding 760 places :
Symmetric choice reduction at 0 with 760 rule applications. Total rules 2600 place count 3600 transition count 6400
Iterating global reduction 0 with 760 rules applied. Total rules applied 3360 place count 3600 transition count 6400
Applied a total of 3360 rules in 1351 ms. Remains 3600 /5280 variables (removed 1680) and now considering 6400/8080 (removed 1680) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8442963752364273616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17307987307850130042.kers'
[2026-05-23 17:14:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8442963752364273616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17307987307850130042.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 6400 rows 3600 cols 12800 entries
Finished phase 1 with 3560 SingleSign rule and 0 generalized
[2026-05-23 17:14:42] [INFO ] Computed 40 invariants in 30 ms
Computed 40 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-17307987307850130042.kers
Total runtime 49 ms.
[2026-05-23 17:14:43] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2026-05-23 17:14:43] [INFO ] Invariant cache hit.
[2026-05-23 17:14:47] [INFO ] Implicit Places using invariants and state equation in 4091 ms returned []
Implicit Place search using SMT with State Equation took 5114 ms to find 0 implicit places.
Running 4960 sub problems to find dead transitions.
[2026-05-23 17:14:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3560/10000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4960 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3600 constraints, PredecessorRefiner: 4960/4960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3560/10000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4960 unsolved in 30174 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3600 constraints, PredecessorRefiner: 0/4960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63217ms problems are : Problem set: 0 solved, 4960 unsolved
Search for dead transitions found 0 dead transitions in 63228ms
Starting structural reductions in LTL mode, iteration 1 : 3600/5280 places, 6400/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69706 ms. Remains : 3600/5280 places, 6400/8080 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(p1)&&X(X(X(X(F(p2)))))&&p0)))'
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-01
Product exploration explored 100000 steps with 906 reset in 3554 ms.
Product exploration explored 100000 steps with 875 reset in 3208 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 5 factoid took 134 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 681 steps (0 resets) in 40 ms. (16 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2026-05-23 17:16:04] [INFO ] Invariant cache hit.
[2026-05-23 17:16:09] [INFO ] [Real]Absence check using 40 positive place invariants in 70 ms returned sat
[2026-05-23 17:16:13] [INFO ] [Real]Absence check using state equation in 3559 ms returned sat
[2026-05-23 17:16:14] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 788 ms.
[2026-05-23 17:16:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:16:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 109 ms returned sat
[2026-05-23 17:16:26] [INFO ] [Nat]Absence check using state equation in 3849 ms returned sat
[2026-05-23 17:16:27] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 682 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Could not prove EG (NOT p2)
[2026-05-23 17:16:31] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 17:16:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 48995 ms.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 400 out of 3600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Applied a total of 0 rules in 411 ms. Remains 3600 /3600 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2026-05-23 17:16:47] [INFO ] Invariant cache hit.
[2026-05-23 17:16:48] [INFO ] Implicit Places using invariants in 861 ms returned []
[2026-05-23 17:16:48] [INFO ] Invariant cache hit.
[2026-05-23 17:16:52] [INFO ] Implicit Places using invariants and state equation in 4469 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5760 ms. Remains : 3600/3600 places, 6400/6400 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 2 factoid took 95 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 672 steps (0 resets) in 54 ms. (12 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2026-05-23 17:16:56] [INFO ] Invariant cache hit.
[2026-05-23 17:17:01] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2026-05-23 17:17:04] [INFO ] [Real]Absence check using state equation in 2909 ms returned sat
[2026-05-23 17:17:05] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 563 ms.
[2026-05-23 17:17:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:17:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 68 ms returned sat
[2026-05-23 17:17:17] [INFO ] [Nat]Absence check using state equation in 3346 ms returned sat
[2026-05-23 17:17:18] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 612 ms.
Could not prove EG (NOT p2)
[2026-05-23 17:17:22] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
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)
[2026-05-23 17:17:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 44810 ms.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 905 reset in 3705 ms.
Product exploration explored 100000 steps with 904 reset in 3289 ms.
Spot run failed in 106 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/ltsmin3383536905987156923
[2026-05-23 17:17:45] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3383536905987156923
Running compilation step : cd /tmp/ltsmin3383536905987156923;'/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/ltsmin3383536905987156923;'/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/ltsmin3383536905987156923;'/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 400 out of 3600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Applied a total of 0 rules in 240 ms. Remains 3600 /3600 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2026-05-23 17:17:48] [INFO ] Invariant cache hit.
[2026-05-23 17:17:49] [INFO ] Implicit Places using invariants in 898 ms returned []
[2026-05-23 17:17:49] [INFO ] Invariant cache hit.
[2026-05-23 17:17:53] [INFO ] Implicit Places using invariants and state equation in 4149 ms returned []
Implicit Place search using SMT with State Equation took 5055 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5300 ms. Remains : 3600/3600 places, 6400/6400 transitions.
Built C files in :
/tmp/ltsmin2531879693437572106
[2026-05-23 17:17:53] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2531879693437572106
Running compilation step : cd /tmp/ltsmin2531879693437572106;'/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/ltsmin2531879693437572106;'/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/ltsmin2531879693437572106;'/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)
[2026-05-23 17:17:57] [INFO ] Flatten gal took : 119 ms
[2026-05-23 17:17:57] [INFO ] Flatten gal took : 119 ms
[2026-05-23 17:17:57] [INFO ] Time to serialize gal into /tmp/LTL8124546372573272413.gal : 53 ms
[2026-05-23 17:17:57] [INFO ] Time to serialize properties into /tmp/LTL7708736509849031050.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8124546372573272413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16446858963561102973.hoa' '-atoms' '/tmp/LTL7708736509849031050.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7708736509849031050.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16446858963561102973.hoa
Detected timeout of ITS tools.
[2026-05-23 17:18:12] [INFO ] Flatten gal took : 101 ms
[2026-05-23 17:18:12] [INFO ] Flatten gal took : 106 ms
[2026-05-23 17:18:12] [INFO ] Time to serialize gal into /tmp/LTL8957145326079970003.gal : 25 ms
[2026-05-23 17:18:12] [INFO ] Time to serialize properties into /tmp/LTL3214192506131680029.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8957145326079970003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3214192506131680029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("((((((TrainState_26_1_1==0)&&(TrainState_25_1_1==0))&&((TrainState_28_1_1==0)&&(TrainState_27_1_1==0)))&&(((TrainState_30_1_1==...11558
Formula 0 simplified : G(!"((((((TrainState_26_1_1==0)&&(TrainState_25_1_1==0))&&((TrainState_28_1_1==0)&&(TrainState_27_1_1==0)))&&(((TrainState_30_1_1==0...11538
Detected timeout of ITS tools.
[2026-05-23 17:18:28] [INFO ] Flatten gal took : 100 ms
[2026-05-23 17:18:28] [INFO ] Applying decomposition
[2026-05-23 17:18:28] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18241258415099589379.txt' '-o' '/tmp/graph18241258415099589379.bin' '-w' '/tmp/graph18241258415099589379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18241258415099589379.bin' '-l' '-1' '-v' '-w' '/tmp/graph18241258415099589379.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:18:28] [INFO ] Decomposing Gal with order
[2026-05-23 17:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:18:30] [INFO ] Removed a total of 548 redundant transitions.
[2026-05-23 17:18:30] [INFO ] Flatten gal took : 545 ms
[2026-05-23 17:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2026-05-23 17:18:30] [INFO ] Time to serialize gal into /tmp/LTL13852706163867997090.gal : 57 ms
[2026-05-23 17:18:30] [INFO ] Time to serialize properties into /tmp/LTL4745368023891905007.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13852706163867997090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4745368023891905007.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("((((((i34.u33.TrainState_26_1_1==0)&&(i23.u32.TrainState_25_1_1==0))&&((i25.u34.TrainState_28_1_1==0)&&(i24.i0.u84.TrainState_2...15257
Formula 0 simplified : G(!"((((((i34.u33.TrainState_26_1_1==0)&&(i23.u32.TrainState_25_1_1==0))&&((i25.u34.TrainState_28_1_1==0)&&(i24.i0.u84.TrainState_27...15237
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
587 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.58802,103928,1,0,158560,10918,13742,269031,913,26413,304977
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-01 finished in 236814 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&&X(F(!p0)))))'
Support contains 3520 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 360 places :
Symmetric choice reduction at 0 with 360 rule applications. Total rules 360 place count 4920 transition count 7720
Iterating global reduction 0 with 360 rules applied. Total rules applied 720 place count 4920 transition count 7720
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 960 place count 4680 transition count 7480
Iterating global reduction 0 with 240 rules applied. Total rules applied 1200 place count 4680 transition count 7480
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1320 place count 4560 transition count 7360
Iterating global reduction 0 with 120 rules applied. Total rules applied 1440 place count 4560 transition count 7360
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1560 place count 4440 transition count 7240
Iterating global reduction 0 with 120 rules applied. Total rules applied 1680 place count 4440 transition count 7240
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1800 place count 4320 transition count 7120
Iterating global reduction 0 with 120 rules applied. Total rules applied 1920 place count 4320 transition count 7120
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 2040 place count 4200 transition count 7000
Iterating global reduction 0 with 120 rules applied. Total rules applied 2160 place count 4200 transition count 7000
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2240 place count 4120 transition count 6920
Iterating global reduction 0 with 80 rules applied. Total rules applied 2320 place count 4120 transition count 6920
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2400 place count 4040 transition count 6840
Iterating global reduction 0 with 80 rules applied. Total rules applied 2480 place count 4040 transition count 6840
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 2520 place count 4000 transition count 6800
Iterating global reduction 0 with 40 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Applied a total of 2560 rules in 449 ms. Remains 4000 /5280 variables (removed 1280) and now considering 6800/8080 (removed 1280) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15775605105221825083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12014180177468007245.kers'
[2026-05-23 17:18:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15775605105221825083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12014180177468007245.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 6800 rows 4000 cols 13600 entries
Finished phase 1 with 3960 SingleSign rule and 0 generalized
[2026-05-23 17:18:38] [INFO ] Computed 40 invariants in 62 ms
Computed 40 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-12014180177468007245.kers
Total runtime 71 ms.
[2026-05-23 17:18:39] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2026-05-23 17:18:39] [INFO ] Invariant cache hit.
[2026-05-23 17:18:43] [INFO ] Implicit Places using invariants and state equation in 4850 ms returned []
Implicit Place search using SMT with State Equation took 5906 ms to find 0 implicit places.
Running 5360 sub problems to find dead transitions.
[2026-05-23 17:18:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3960/10800 variables, and 0 constraints, problems are : Problem set: 0 solved, 5360 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/4000 constraints, PredecessorRefiner: 5360/5360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5360 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 3960/10800 variables, and 0 constraints, problems are : Problem set: 0 solved, 5360 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/4000 constraints, PredecessorRefiner: 0/5360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63677ms problems are : Problem set: 0 solved, 5360 unsolved
Search for dead transitions found 0 dead transitions in 63687ms
Starting structural reductions in LTL mode, iteration 1 : 4000/5280 places, 6800/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70056 ms. Remains : 4000/5280 places, 6800/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))&&p0)))'
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-PT-040-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-03 finished in 70326 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)&&(p1 U p2)))'
Support contains 4880 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 31 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (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-8885625535774194130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1652033259580623509.kers'
[2026-05-23 17:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8885625535774194130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1652033259580623509.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 8080 rows 5280 cols 16160 entries
Finished phase 1 with 5240 SingleSign rule and 0 generalized
[2026-05-23 17:19:48] [INFO ] Computed 40 invariants in 77 ms
Computed 40 P flows in 78 ms.
Exported basis to /tmp/petrispot-output-1652033259580623509.kers
Total runtime 88 ms.
[2026-05-23 17:19:50] [INFO ] Implicit Places using invariants in 2240 ms returned []
[2026-05-23 17:19:50] [INFO ] Invariant cache hit.
[2026-05-23 17:19:57] [INFO ] Implicit Places using invariants and state equation in 6789 ms returned []
Implicit Place search using SMT with State Equation took 9053 ms to find 0 implicit places.
Running 6640 sub problems to find dead transitions.
[2026-05-23 17:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5240 variables, 5240/5240 constraints. Problems are: Problem set: 0 solved, 6640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5240/13360 variables, and 5240 constraints, problems are : Problem set: 0 solved, 6640 unsolved in 30243 ms.
Refiners :[Domain max(s): 5240/5280 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/5280 constraints, PredecessorRefiner: 6640/6640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5240 variables, 5240/5240 constraints. Problems are: Problem set: 0 solved, 6640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5240/13360 variables, and 5240 constraints, problems are : Problem set: 0 solved, 6640 unsolved in 30215 ms.
Refiners :[Domain max(s): 5240/5280 constraints, Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/5280 constraints, PredecessorRefiner: 0/6640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65556ms problems are : Problem set: 0 solved, 6640 unsolved
Search for dead transitions found 0 dead transitions in 65570ms
Finished structural reductions in LTL mode , in 1 iterations and 74675 ms. Remains : 5280/5280 places, 8080/8080 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)&&(p1 U p2)))'
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-04
Entered a terminal (fully accepting) state of product in 55 steps with 27 reset in 10 ms.
FORMULA BART-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-04 finished in 74930 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)&&F(G(p1)))))'
Support contains 2720 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 5280 transition count 7960
Reduce places removed 120 places and 0 transitions.
Performed 1080 Post agglomeration using F-continuation condition.Transition count delta: 1080
Iterating post reduction 1 with 1200 rules applied. Total rules applied 1320 place count 5160 transition count 6880
Reduce places removed 1080 places and 0 transitions.
Iterating post reduction 2 with 1080 rules applied. Total rules applied 2400 place count 4080 transition count 6880
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2440 place count 4040 transition count 6840
Iterating global reduction 3 with 40 rules applied. Total rules applied 2480 place count 4040 transition count 6840
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 2800 place count 3880 transition count 6680
Applied a total of 2800 rules in 720 ms. Remains 3880 /5280 variables (removed 1400) and now considering 6680/8080 (removed 1400) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4629826060114905530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5247903717518405953.kers'
[2026-05-23 17:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4629826060114905530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5247903717518405953.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 6680 rows 3880 cols 13360 entries
Finished phase 1 with 3840 SingleSign rule and 0 generalized
[2026-05-23 17:21:03] [INFO ] Computed 40 invariants in 35 ms
Computed 40 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-5247903717518405953.kers
Total runtime 43 ms.
[2026-05-23 17:21:04] [INFO ] Implicit Places using invariants in 787 ms returned []
[2026-05-23 17:21:04] [INFO ] Invariant cache hit.
[2026-05-23 17:21:08] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned []
Implicit Place search using SMT with State Equation took 4692 ms to find 0 implicit places.
[2026-05-23 17:21:09] [INFO ] Redundant transitions in 689 ms returned []
Running 5240 sub problems to find dead transitions.
[2026-05-23 17:21:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3840/10560 variables, and 0 constraints, problems are : Problem set: 0 solved, 5240 unsolved in 30151 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3880 constraints, PredecessorRefiner: 5240/5240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3840/10560 variables, and 0 constraints, problems are : Problem set: 0 solved, 5240 unsolved in 30178 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3880 constraints, PredecessorRefiner: 0/5240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63355ms problems are : Problem set: 0 solved, 5240 unsolved
Search for dead transitions found 0 dead transitions in 63367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3880/5280 places, 6680/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69495 ms. Remains : 3880/5280 places, 6680/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 2446 ms.
Product exploration explored 100000 steps with 0 reset in 1839 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 119 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2026-05-23 17:22:31] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Knowledge-based reduction took 29684 ms.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2720 out of 3880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3880/3880 places, 6680/6680 transitions.
Applied a total of 0 rules in 95 ms. Remains 3880 /3880 variables (removed 0) and now considering 6680/6680 (removed 0) transitions.
[2026-05-23 17:22:46] [INFO ] Invariant cache hit.
[2026-05-23 17:22:47] [INFO ] Implicit Places using invariants in 953 ms returned []
[2026-05-23 17:22:47] [INFO ] Invariant cache hit.
[2026-05-23 17:22:51] [INFO ] Implicit Places using invariants and state equation in 3939 ms returned []
Implicit Place search using SMT with State Equation took 4896 ms to find 0 implicit places.
[2026-05-23 17:22:52] [INFO ] Redundant transitions in 568 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5565 ms. Remains : 3880/3880 places, 6680/6680 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 120 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2026-05-23 17:23:08] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Knowledge-based reduction took 31598 ms.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 2178 ms.
Product exploration explored 100000 steps with 0 reset in 2283 ms.
Built C files in :
/tmp/ltsmin11154833431581206895
[2026-05-23 17:23:28] [INFO ] Too many transitions (6680) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:23:29] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11154833431581206895
Running compilation step : cd /tmp/ltsmin11154833431581206895;'/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/ltsmin11154833431581206895;'/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/ltsmin11154833431581206895;'/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 2720 out of 3880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3880/3880 places, 6680/6680 transitions.
Applied a total of 0 rules in 89 ms. Remains 3880 /3880 variables (removed 0) and now considering 6680/6680 (removed 0) transitions.
[2026-05-23 17:23:32] [INFO ] Invariant cache hit.
[2026-05-23 17:23:32] [INFO ] Implicit Places using invariants in 866 ms returned []
[2026-05-23 17:23:32] [INFO ] Invariant cache hit.
[2026-05-23 17:23:37] [INFO ] Implicit Places using invariants and state equation in 4507 ms returned []
Implicit Place search using SMT with State Equation took 5380 ms to find 0 implicit places.
[2026-05-23 17:23:38] [INFO ] Redundant transitions in 763 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6239 ms. Remains : 3880/3880 places, 6680/6680 transitions.
Built C files in :
/tmp/ltsmin8534424030071090626
[2026-05-23 17:23:38] [INFO ] Too many transitions (6680) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:23:38] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8534424030071090626
Running compilation step : cd /tmp/ltsmin8534424030071090626;'/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/ltsmin8534424030071090626;'/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/ltsmin8534424030071090626;'/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)
[2026-05-23 17:23:41] [INFO ] Flatten gal took : 176 ms
[2026-05-23 17:23:41] [INFO ] Flatten gal took : 161 ms
[2026-05-23 17:23:42] [INFO ] Time to serialize gal into /tmp/LTL4877263830905983747.gal : 35 ms
[2026-05-23 17:23:42] [INFO ] Time to serialize properties into /tmp/LTL1963633274186673261.prop : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4877263830905983747.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5738312937502865034.hoa' '-atoms' '/tmp/LTL1963633274186673261.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1963633274186673261.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5738312937502865034.hoa
Detected timeout of ITS tools.
[2026-05-23 17:23:57] [INFO ] Flatten gal took : 109 ms
[2026-05-23 17:23:57] [INFO ] Flatten gal took : 128 ms
[2026-05-23 17:23:57] [INFO ] Time to serialize gal into /tmp/LTL2924937914529465280.gal : 23 ms
[2026-05-23 17:23:57] [INFO ] Time to serialize properties into /tmp/LTL4861805312117124175.ltl : 34 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2924937914529465280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4861805312117124175.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((((TrainState_11_1_6==1)||(TrainState_5_1_8==1))||((TrainState_5_1_35==1)||(TrainState_11_4_17==1)))||(((TrainState...217084
Formula 0 simplified : F(G!"(((((((((((((TrainState_11_1_6==1)||(TrainState_5_1_8==1))||((TrainState_5_1_35==1)||(TrainState_11_4_17==1)))||(((TrainState_9...217074
Detected timeout of ITS tools.
[2026-05-23 17:24:12] [INFO ] Flatten gal took : 96 ms
[2026-05-23 17:24:12] [INFO ] Applying decomposition
[2026-05-23 17:24:12] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17958715414206234971.txt' '-o' '/tmp/graph17958715414206234971.bin' '-w' '/tmp/graph17958715414206234971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17958715414206234971.bin' '-l' '-1' '-v' '-w' '/tmp/graph17958715414206234971.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:24:13] [INFO ] Decomposing Gal with order
[2026-05-23 17:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:24:14] [INFO ] Removed a total of 535 redundant transitions.
[2026-05-23 17:24:14] [INFO ] Flatten gal took : 393 ms
[2026-05-23 17:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 38 ms.
[2026-05-23 17:24:15] [INFO ] Time to serialize gal into /tmp/LTL10274794002457333316.gal : 37 ms
[2026-05-23 17:24:15] [INFO ] Time to serialize properties into /tmp/LTL17632033083134712722.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10274794002457333316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17632033083134712722.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((((i27.u107.TrainState_11_1_6==1)||(i24.u98.TrainState_5_1_8==1))||((i24.u98.TrainState_5_1_35==1)||(i27.u158.Train...286039
Formula 0 simplified : F(G!"(((((((((((((i27.u107.TrainState_11_1_6==1)||(i24.u98.TrainState_5_1_8==1))||((i24.u98.TrainState_5_1_35==1)||(i27.u158.TrainSt...286029
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
735 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.07963,143408,1,0,49208,13697,60275,48845,8397,30386,152149
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-05 finished in 200807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!F(X(p0)) U p1) U X(p2)))))'
Support contains 440 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 920 places :
Symmetric choice reduction at 0 with 920 rule applications. Total rules 920 place count 4360 transition count 7160
Iterating global reduction 0 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Discarding 760 places :
Symmetric choice reduction at 0 with 760 rule applications. Total rules 2600 place count 3600 transition count 6400
Iterating global reduction 0 with 760 rules applied. Total rules applied 3360 place count 3600 transition count 6400
Applied a total of 3360 rules in 1266 ms. Remains 3600 /5280 variables (removed 1680) and now considering 6400/8080 (removed 1680) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1349202057621102347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8292710101524646333.kers'
[2026-05-23 17:24:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1349202057621102347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8292710101524646333.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 6400 rows 3600 cols 12800 entries
Finished phase 1 with 3560 SingleSign rule and 0 generalized
[2026-05-23 17:24:25] [INFO ] Computed 40 invariants in 50 ms
Computed 40 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-8292710101524646333.kers
Total runtime 56 ms.
[2026-05-23 17:24:25] [INFO ] Implicit Places using invariants in 871 ms returned []
[2026-05-23 17:24:25] [INFO ] Invariant cache hit.
[2026-05-23 17:24:29] [INFO ] Implicit Places using invariants and state equation in 3853 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
Running 4960 sub problems to find dead transitions.
[2026-05-23 17:24:29] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3560/10000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4960 unsolved in 30175 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3600 constraints, PredecessorRefiner: 4960/4960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4960 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3560/10000 variables, and 0 constraints, problems are : Problem set: 0 solved, 4960 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/3600 constraints, PredecessorRefiner: 0/4960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63393ms problems are : Problem set: 0 solved, 4960 unsolved
Search for dead transitions found 0 dead transitions in 63401ms
Starting structural reductions in LTL mode, iteration 1 : 3600/5280 places, 6400/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69405 ms. Remains : 3600/5280 places, 6400/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!F(X(p0)) U p1) U X(p2)))))'
Stuttering acceptance computed with spot in 359 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : BART-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 1590 reset in 4608 ms.
Product exploration explored 100000 steps with 1560 reset in 4990 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 19 factoid took 409 ms. Reduced automaton from 7 states, 33 edges and 3 AP (stutter sensitive) to 7 states, 33 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1586 ms. (25 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1565 ms. (25 steps per ms) remains 1/1 properties
[2026-05-23 17:25:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3160/3600 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10000/10000 variables, and 3640 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3390 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 3600/3600 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3160/3600 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10000/10000 variables, and 3640 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3827 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 3600/3600 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7241ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 19 ms.
Knowledge based reduction with 19 factoid took 654 ms. Reduced automaton from 7 states, 33 edges and 3 AP (stutter sensitive) to 7 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
[2026-05-23 17:26:08] [INFO ] Invariant cache hit.
[2026-05-23 17:26:13] [INFO ] [Real]Absence check using 40 positive place invariants in 68 ms returned sat
[2026-05-23 17:26:16] [INFO ] [Real]Absence check using state equation in 3162 ms returned sat
[2026-05-23 17:26:17] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 485 ms.
[2026-05-23 17:26:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:26:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 71 ms returned sat
[2026-05-23 17:26:27] [INFO ] [Nat]Absence check using state equation in 3093 ms returned sat
[2026-05-23 17:26:28] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 497 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 50587 ms.
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 440 out of 3600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Applied a total of 0 rules in 520 ms. Remains 3600 /3600 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2026-05-23 17:26:34] [INFO ] Invariant cache hit.
[2026-05-23 17:26:35] [INFO ] Implicit Places using invariants in 971 ms returned []
[2026-05-23 17:26:35] [INFO ] Invariant cache hit.
[2026-05-23 17:26:39] [INFO ] Implicit Places using invariants and state equation in 3968 ms returned []
Implicit Place search using SMT with State Equation took 4953 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5474 ms. Remains : 3600/3600 places, 6400/6400 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 19 factoid took 347 ms. Reduced automaton from 7 states, 33 edges and 3 AP (stutter sensitive) to 7 states, 33 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 994 ms. (40 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 902 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 886 ms. (45 steps per ms) remains 2/2 properties
[2026-05-23 17:29:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3160/3600 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6400/10000 variables, 3600/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10000 variables, 0/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/10000 variables, 0/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10000/10000 variables, and 3640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 3600/3600 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3160/3600 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6400/10000 variables, 3600/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10000 variables, 0/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/10000 variables, 0/3640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 10000/10000 variables, and 3640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 3600/3600 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10054ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 440 out of 3600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 3600 transition count 5960
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 3160 transition count 5960
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 880 place count 3160 transition count 5800
Deduced a syphon composed of 160 places in 5 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1200 place count 3000 transition count 5800
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 0 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2800 place count 2200 transition count 5000
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 2840 place count 2200 transition count 4960
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 2920 place count 2160 transition count 4920
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 2960 place count 2160 transition count 4880
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 3040 place count 2120 transition count 4840
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 3080 place count 2120 transition count 4800
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 3160 place count 2080 transition count 4760
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 3200 place count 2080 transition count 4720
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 3280 place count 2040 transition count 4680
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 6 with 80 rules applied. Total rules applied 3360 place count 2040 transition count 4600
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 3440 place count 2000 transition count 4560
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 7 with 80 rules applied. Total rules applied 3520 place count 2000 transition count 4480
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 3600 place count 1960 transition count 4440
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 8 with 80 rules applied. Total rules applied 3680 place count 1960 transition count 4360
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 3760 place count 1920 transition count 4320
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 9 with 80 rules applied. Total rules applied 3840 place count 1920 transition count 4240
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 3920 place count 1880 transition count 4200
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 10 with 80 rules applied. Total rules applied 4000 place count 1880 transition count 4120
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 11 with 80 rules applied. Total rules applied 4080 place count 1840 transition count 4080
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 11 with 80 rules applied. Total rules applied 4160 place count 1840 transition count 4000
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 12 with 80 rules applied. Total rules applied 4240 place count 1800 transition count 3960
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 12 with 80 rules applied. Total rules applied 4320 place count 1800 transition count 3880
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 13 with 80 rules applied. Total rules applied 4400 place count 1760 transition count 3840
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 13 with 80 rules applied. Total rules applied 4480 place count 1760 transition count 3760
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 14 with 80 rules applied. Total rules applied 4560 place count 1720 transition count 3720
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 14 with 80 rules applied. Total rules applied 4640 place count 1720 transition count 3640
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 15 with 80 rules applied. Total rules applied 4720 place count 1680 transition count 3600
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 15 with 80 rules applied. Total rules applied 4800 place count 1680 transition count 3520
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 16 with 80 rules applied. Total rules applied 4880 place count 1640 transition count 3480
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 16 with 80 rules applied. Total rules applied 4960 place count 1640 transition count 3400
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 17 with 80 rules applied. Total rules applied 5040 place count 1600 transition count 3360
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 17 with 80 rules applied. Total rules applied 5120 place count 1600 transition count 3280
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 18 with 80 rules applied. Total rules applied 5200 place count 1560 transition count 3240
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 18 with 80 rules applied. Total rules applied 5280 place count 1560 transition count 3160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 19 with 80 rules applied. Total rules applied 5360 place count 1520 transition count 3120
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 19 with 80 rules applied. Total rules applied 5440 place count 1520 transition count 3040
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 20 with 80 rules applied. Total rules applied 5520 place count 1480 transition count 3000
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 20 with 80 rules applied. Total rules applied 5600 place count 1480 transition count 2920
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 21 with 80 rules applied. Total rules applied 5680 place count 1440 transition count 2880
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 21 with 80 rules applied. Total rules applied 5760 place count 1440 transition count 2800
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 22 with 80 rules applied. Total rules applied 5840 place count 1400 transition count 2760
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 22 with 80 rules applied. Total rules applied 5920 place count 1400 transition count 2680
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 23 with 80 rules applied. Total rules applied 6000 place count 1360 transition count 2640
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 23 with 80 rules applied. Total rules applied 6080 place count 1360 transition count 2560
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 24 with 80 rules applied. Total rules applied 6160 place count 1320 transition count 2520
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 24 with 80 rules applied. Total rules applied 6240 place count 1320 transition count 2440
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 25 with 80 rules applied. Total rules applied 6320 place count 1280 transition count 2400
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 25 with 40 rules applied. Total rules applied 6360 place count 1280 transition count 2360
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 26 with 80 rules applied. Total rules applied 6440 place count 1240 transition count 2320
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 26 with 40 rules applied. Total rules applied 6480 place count 1240 transition count 2280
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 27 with 80 rules applied. Total rules applied 6560 place count 1200 transition count 2240
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 27 with 40 rules applied. Total rules applied 6600 place count 1200 transition count 2200
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 28 with 80 rules applied. Total rules applied 6680 place count 1160 transition count 2160
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 28 with 80 rules applied. Total rules applied 6760 place count 1160 transition count 2080
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 29 with 80 rules applied. Total rules applied 6840 place count 1120 transition count 2040
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 29 with 80 rules applied. Total rules applied 6920 place count 1120 transition count 1960
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 30 with 80 rules applied. Total rules applied 7000 place count 1080 transition count 1920
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 30 with 80 rules applied. Total rules applied 7080 place count 1080 transition count 1840
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 31 with 80 rules applied. Total rules applied 7160 place count 1040 transition count 1800
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 31 with 80 rules applied. Total rules applied 7240 place count 1040 transition count 1720
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 32 with 80 rules applied. Total rules applied 7320 place count 1000 transition count 1680
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 32 with 40 rules applied. Total rules applied 7360 place count 1000 transition count 1640
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 33 with 80 rules applied. Total rules applied 7440 place count 960 transition count 1600
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 33 with 40 rules applied. Total rules applied 7480 place count 960 transition count 1560
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 34 with 80 rules applied. Total rules applied 7560 place count 920 transition count 1520
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 34 with 80 rules applied. Total rules applied 7640 place count 920 transition count 1440
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 35 with 80 rules applied. Total rules applied 7720 place count 880 transition count 1400
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 35 with 80 rules applied. Total rules applied 7800 place count 880 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 36 with 40 rules applied. Total rules applied 7840 place count 880 transition count 1280
Discarding 40 places :
Symmetric choice reduction at 36 with 40 rule applications. Total rules 7880 place count 840 transition count 1240
Iterating global reduction 36 with 40 rules applied. Total rules applied 7920 place count 840 transition count 1240
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 36 with 40 rules applied. Total rules applied 7960 place count 840 transition count 1200
Applied a total of 7960 rules in 3219 ms. Remains 840 /3600 variables (removed 2760) and now considering 1200/6400 (removed 5200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3219 ms. Remains : 840/3600 places, 1200/6400 transitions.
RANDOM walk for 40000 steps (8 resets) in 538 ms. (74 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1060 ms. (37 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13675931041201888767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17876541196545004172.kers'
[2026-05-23 17:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13675931041201888767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17876541196545004172.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1200 rows 840 cols 2400 entries
Finished phase 1 with 800 SingleSign rule and 0 generalized
[2026-05-23 17:30:04] [INFO ] Computed 40 invariants in 5 ms
Computed 40 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17876541196545004172.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 400/840 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1200/2040 variables, 840/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/2040 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2040/2040 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 840/840 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 400/840 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1200/2040 variables, 840/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/2040 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2040/2040 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 840/840 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2445ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 145 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 19 factoid took 623 ms. Reduced automaton from 7 states, 33 edges and 3 AP (stutter sensitive) to 7 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17921091763868873168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7312008409481284029.kers'
[2026-05-23 17:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17921091763868873168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7312008409481284029.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 6400 rows 3600 cols 12800 entries
Finished phase 1 with 3560 SingleSign rule and 0 generalized
[2026-05-23 17:30:07] [INFO ] Computed 40 invariants in 46 ms
Computed 40 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-7312008409481284029.kers
Total runtime 51 ms.
[2026-05-23 17:30:13] [INFO ] [Real]Absence check using 40 positive place invariants in 63 ms returned sat
[2026-05-23 17:30:16] [INFO ] [Real]Absence check using state equation in 3217 ms returned sat
[2026-05-23 17:30:17] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 446 ms.
[2026-05-23 17:30:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:30:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 93 ms returned sat
[2026-05-23 17:30:28] [INFO ] [Nat]Absence check using state equation in 3463 ms returned sat
[2026-05-23 17:30:29] [INFO ] Computed and/alt/rep : 4960/9120/4960 causal constraints (skipped 0 transitions) in 534 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 233967 ms.
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1580 reset in 5462 ms.
Product exploration explored 100000 steps with 1571 reset in 5000 ms.
Spot run failed in 87 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/ltsmin16679630748706706461
[2026-05-23 17:30:44] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16679630748706706461
Running compilation step : cd /tmp/ltsmin16679630748706706461;'/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/ltsmin16679630748706706461;'/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/ltsmin16679630748706706461;'/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 440 out of 3600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Applied a total of 0 rules in 496 ms. Remains 3600 /3600 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2026-05-23 17:30:48] [INFO ] Invariant cache hit.
[2026-05-23 17:30:49] [INFO ] Implicit Places using invariants in 797 ms returned []
[2026-05-23 17:30:49] [INFO ] Invariant cache hit.
[2026-05-23 17:30:53] [INFO ] Implicit Places using invariants and state equation in 4048 ms returned []
Implicit Place search using SMT with State Equation took 4848 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5347 ms. Remains : 3600/3600 places, 6400/6400 transitions.
Built C files in :
/tmp/ltsmin11629326363779057996
[2026-05-23 17:30:53] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11629326363779057996
Running compilation step : cd /tmp/ltsmin11629326363779057996;'/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/ltsmin11629326363779057996;'/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/ltsmin11629326363779057996;'/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)
[2026-05-23 17:30:58] [INFO ] Flatten gal took : 518 ms
[2026-05-23 17:30:58] [INFO ] Flatten gal took : 282 ms
[2026-05-23 17:30:58] [INFO ] Time to serialize gal into /tmp/LTL13979725732135553822.gal : 53 ms
[2026-05-23 17:30:58] [INFO ] Time to serialize properties into /tmp/LTL16654011773505276905.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13979725732135553822.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6316609794728688576.hoa' '-atoms' '/tmp/LTL16654011773505276905.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16654011773505276905.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6316609794728688576.hoa
Detected timeout of ITS tools.
[2026-05-23 17:31:13] [INFO ] Flatten gal took : 140 ms
[2026-05-23 17:31:13] [INFO ] Flatten gal took : 127 ms
[2026-05-23 17:31:13] [INFO ] Time to serialize gal into /tmp/LTL10228105861820395597.gal : 22 ms
[2026-05-23 17:31:13] [INFO ] Time to serialize properties into /tmp/LTL6775974738438592473.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10228105861820395597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6775974738438592473.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((!(F(X("((((((((((TrainState_38_2_4==1)||(TrainState_22_3_8==1))||((TrainState_15_4_14==1)||(TrainState_39_2_5==1)))||(((Train...11549
Formula 0 simplified : GF((!"(((((((TrainState_7_0_0==1)||(TrainState_28_0_0==1))||((TrainState_26_0_0==1)||(TrainState_31_0_0==1)))||(((TrainState_36_0_0=...12570
Detected timeout of ITS tools.
[2026-05-23 17:31:29] [INFO ] Flatten gal took : 128 ms
[2026-05-23 17:31:29] [INFO ] Applying decomposition
[2026-05-23 17:31:29] [INFO ] Flatten gal took : 162 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15870979488176086363.txt' '-o' '/tmp/graph15870979488176086363.bin' '-w' '/tmp/graph15870979488176086363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15870979488176086363.bin' '-l' '-1' '-v' '-w' '/tmp/graph15870979488176086363.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:31:29] [INFO ] Decomposing Gal with order
[2026-05-23 17:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:31:31] [INFO ] Removed a total of 492 redundant transitions.
[2026-05-23 17:31:31] [INFO ] Flatten gal took : 282 ms
[2026-05-23 17:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2026-05-23 17:31:31] [INFO ] Time to serialize gal into /tmp/LTL16483786905077051863.gal : 38 ms
[2026-05-23 17:31:31] [INFO ] Time to serialize properties into /tmp/LTL8942431758953342994.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16483786905077051863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8942431758953342994.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(((!(F(X("((((((((((i35.u41.TrainState_38_2_4==1)||(i16.u321.TrainState_22_3_8==1))||((i3.u558.TrainState_15_4_14==1)||(i11.u80....15269
Formula 0 simplified : GF((!"(((((((i2.u92.TrainState_7_0_0==1)||(i23.u168.TrainState_28_0_0==1))||((i25.u286.TrainState_26_0_0==1)||(i9.u102.TrainState_31...16630
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
721 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.93528,143760,1,0,227450,11220,17569,396555,979,26407,518339
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-06 finished in 436334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 360 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 7120 edges and 5280 vertex of which 1640 / 5280 are part of one of the 40 SCC in 42 ms
Free SCC test removed 1600 places
Ensure Unique test removed 3000 transitions
Reduce isomorphic transitions removed 3000 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2240 transitions
Trivial Post-agglo rules discarded 2240 transitions
Performed 2240 trivial Post agglomeration. Transition count delta: 2240
Iterating post reduction 0 with 2240 rules applied. Total rules applied 2241 place count 3680 transition count 2840
Reduce places removed 2240 places and 0 transitions.
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 1 with 2720 rules applied. Total rules applied 4961 place count 1440 transition count 2360
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 2 with 480 rules applied. Total rules applied 5441 place count 1280 transition count 2040
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 3 with 480 rules applied. Total rules applied 5921 place count 1120 transition count 1720
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 4 with 320 rules applied. Total rules applied 6241 place count 960 transition count 1560
Discarding 200 places :
Symmetric choice reduction at 5 with 200 rule applications. Total rules 6441 place count 760 transition count 1360
Iterating global reduction 5 with 200 rules applied. Total rules applied 6641 place count 760 transition count 1360
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 6841 place count 760 transition count 1160
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 6881 place count 760 transition count 1120
Applied a total of 6881 rules in 264 ms. Remains 760 /5280 variables (removed 4520) and now considering 1120/8080 (removed 6960) transitions.
[2026-05-23 17:31:40] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12055303396909322801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17473168994414545790.kers'
[2026-05-23 17:31:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12055303396909322801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17473168994414545790.kers]
Normalized transition count is 1080 out of 1081 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1080 rows 760 cols 2160 entries
Finished phase 1 with 720 SingleSign rule and 0 generalized
[2026-05-23 17:31:40] [INFO ] Computed 40 invariants in 8 ms
Computed 40 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17473168994414545790.kers
Total runtime 12 ms.
[2026-05-23 17:31:40] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 17:31:40] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2026-05-23 17:31:40] [INFO ] Invariant cache hit.
[2026-05-23 17:31:41] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2026-05-23 17:31:41] [INFO ] Redundant transitions in 95 ms returned []
Running 720 sub problems to find dead transitions.
[2026-05-23 17:31:41] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2026-05-23 17:31:41] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 720 unsolved
SMT process timed out in 30245ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 760/5280 places, 1120/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31528 ms. Remains : 760/5280 places, 1120/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-07
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 15 ms.
FORMULA BART-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-07 finished in 31744 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(!p0)&&F((p1 U (p2||G(p1))))) U X(p3)))'
Support contains 5 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1078 places :
Symmetric choice reduction at 0 with 1078 rule applications. Total rules 3634 place count 2924 transition count 5724
Iterating global reduction 0 with 1078 rules applied. Total rules applied 4712 place count 2924 transition count 5724
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4871 place count 2765 transition count 5565
Iterating global reduction 0 with 159 rules applied. Total rules applied 5030 place count 2765 transition count 5565
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5149 place count 2646 transition count 5446
Iterating global reduction 0 with 119 rules applied. Total rules applied 5268 place count 2646 transition count 5446
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5387 place count 2527 transition count 5327
Iterating global reduction 0 with 119 rules applied. Total rules applied 5506 place count 2527 transition count 5327
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5625 place count 2408 transition count 5208
Iterating global reduction 0 with 119 rules applied. Total rules applied 5744 place count 2408 transition count 5208
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5863 place count 2289 transition count 5089
Iterating global reduction 0 with 119 rules applied. Total rules applied 5982 place count 2289 transition count 5089
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6101 place count 2170 transition count 4970
Iterating global reduction 0 with 119 rules applied. Total rules applied 6220 place count 2170 transition count 4970
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6299 place count 2091 transition count 4891
Iterating global reduction 0 with 79 rules applied. Total rules applied 6378 place count 2091 transition count 4891
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 6456 place count 2013 transition count 4813
Iterating global reduction 0 with 78 rules applied. Total rules applied 6534 place count 2013 transition count 4813
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6574 place count 1973 transition count 4773
Iterating global reduction 0 with 40 rules applied. Total rules applied 6614 place count 1973 transition count 4773
Applied a total of 6614 rules in 4626 ms. Remains 1973 /5280 variables (removed 3307) and now considering 4773/8080 (removed 3307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3031587368522070383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6292203704695658543.kers'
[2026-05-23 17:32:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3031587368522070383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6292203704695658543.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4773 rows 1973 cols 9546 entries
Finished phase 1 with 1933 SingleSign rule and 0 generalized
[2026-05-23 17:32:16] [INFO ] Computed 40 invariants in 18 ms
Computed 40 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-6292203704695658543.kers
Total runtime 24 ms.
[2026-05-23 17:32:17] [INFO ] Implicit Places using invariants in 563 ms returned []
[2026-05-23 17:32:17] [INFO ] Invariant cache hit.
[2026-05-23 17:32:19] [INFO ] Implicit Places using invariants and state equation in 2302 ms returned []
Implicit Place search using SMT with State Equation took 2869 ms to find 0 implicit places.
Running 3333 sub problems to find dead transitions.
[2026-05-23 17:32:19] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1933/6746 variables, and 0 constraints, problems are : Problem set: 0 solved, 3333 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1973 constraints, PredecessorRefiner: 3333/3333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3333 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1933/6746 variables, and 0 constraints, problems are : Problem set: 0 solved, 3333 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1973 constraints, PredecessorRefiner: 0/3333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62709ms problems are : Problem set: 0 solved, 3333 unsolved
Search for dead transitions found 0 dead transitions in 62761ms
Starting structural reductions in LTL mode, iteration 1 : 1973/5280 places, 4773/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70296 ms. Remains : 1973/5280 places, 4773/8080 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)&&F((p1 U (p2||G(p1))))) U X(p3)))'
Stuttering acceptance computed with spot in 365 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p3), true, p0, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-040-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA BART-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-08 finished in 70776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1||G(p2)))))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3637 place count 2922 transition count 5722
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4716 place count 2922 transition count 5722
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4876 place count 2762 transition count 5562
Iterating global reduction 0 with 160 rules applied. Total rules applied 5036 place count 2762 transition count 5562
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5155 place count 2643 transition count 5443
Iterating global reduction 0 with 119 rules applied. Total rules applied 5274 place count 2643 transition count 5443
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5393 place count 2524 transition count 5324
Iterating global reduction 0 with 119 rules applied. Total rules applied 5512 place count 2524 transition count 5324
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5631 place count 2405 transition count 5205
Iterating global reduction 0 with 119 rules applied. Total rules applied 5750 place count 2405 transition count 5205
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5869 place count 2286 transition count 5086
Iterating global reduction 0 with 119 rules applied. Total rules applied 5988 place count 2286 transition count 5086
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6107 place count 2167 transition count 4967
Iterating global reduction 0 with 119 rules applied. Total rules applied 6226 place count 2167 transition count 4967
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6305 place count 2088 transition count 4888
Iterating global reduction 0 with 79 rules applied. Total rules applied 6384 place count 2088 transition count 4888
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6463 place count 2009 transition count 4809
Iterating global reduction 0 with 79 rules applied. Total rules applied 6542 place count 2009 transition count 4809
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 6581 place count 1970 transition count 4770
Iterating global reduction 0 with 39 rules applied. Total rules applied 6620 place count 1970 transition count 4770
Applied a total of 6620 rules in 3425 ms. Remains 1970 /5280 variables (removed 3310) and now considering 4770/8080 (removed 3310) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10184679256805588988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14821466389263203755.kers'
[2026-05-23 17:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10184679256805588988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14821466389263203755.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4770 rows 1970 cols 9540 entries
Finished phase 1 with 1930 SingleSign rule and 0 generalized
[2026-05-23 17:33:26] [INFO ] Computed 40 invariants in 27 ms
Computed 40 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-14821466389263203755.kers
Total runtime 31 ms.
[2026-05-23 17:33:26] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-23 17:33:26] [INFO ] Invariant cache hit.
[2026-05-23 17:33:28] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
Running 3330 sub problems to find dead transitions.
[2026-05-23 17:33:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1930/6740 variables, and 0 constraints, problems are : Problem set: 0 solved, 3330 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1970 constraints, PredecessorRefiner: 3330/3330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3330 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 1930/6740 variables, and 0 constraints, problems are : Problem set: 0 solved, 3330 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1970 constraints, PredecessorRefiner: 0/3330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62285ms problems are : Problem set: 0 solved, 3330 unsolved
Search for dead transitions found 0 dead transitions in 62294ms
Starting structural reductions in LTL mode, iteration 1 : 1970/5280 places, 4770/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68336 ms. Remains : 1970/5280 places, 4770/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1||G(p2)))))))'
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1063 ms.
Product exploration explored 100000 steps with 0 reset in 809 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 2 factoid took 166 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 6901 steps (1 resets) in 249 ms. (27 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 2564 ms.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 1970 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1970/1970 places, 4770/4770 transitions.
Applied a total of 0 rules in 145 ms. Remains 1970 /1970 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
[2026-05-23 17:34:35] [INFO ] Invariant cache hit.
[2026-05-23 17:34:36] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-23 17:34:36] [INFO ] Invariant cache hit.
[2026-05-23 17:34:38] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2649 ms. Remains : 1970/1970 places, 4770/4770 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 70 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 7363 steps (1 resets) in 86 ms. (84 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 2136 ms.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 893 ms.
Product exploration explored 100000 steps with 0 reset in 924 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/ltsmin9079151408885454026
[2026-05-23 17:34:42] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9079151408885454026
Running compilation step : cd /tmp/ltsmin9079151408885454026;'/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/ltsmin9079151408885454026;'/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/ltsmin9079151408885454026;'/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 2 out of 1970 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1970/1970 places, 4770/4770 transitions.
Applied a total of 0 rules in 241 ms. Remains 1970 /1970 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
[2026-05-23 17:34:46] [INFO ] Invariant cache hit.
[2026-05-23 17:34:46] [INFO ] Implicit Places using invariants in 453 ms returned []
[2026-05-23 17:34:46] [INFO ] Invariant cache hit.
[2026-05-23 17:34:48] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2992 ms. Remains : 1970/1970 places, 4770/4770 transitions.
Built C files in :
/tmp/ltsmin14102785637716894340
[2026-05-23 17:34:48] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14102785637716894340
Running compilation step : cd /tmp/ltsmin14102785637716894340;'/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/ltsmin14102785637716894340;'/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/ltsmin14102785637716894340;'/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)
[2026-05-23 17:34:53] [INFO ] Flatten gal took : 574 ms
[2026-05-23 17:34:53] [INFO ] Flatten gal took : 332 ms
[2026-05-23 17:34:53] [INFO ] Time to serialize gal into /tmp/LTL9070410878716004208.gal : 42 ms
[2026-05-23 17:34:53] [INFO ] Time to serialize properties into /tmp/LTL4353941258100450734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9070410878716004208.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5966611062119155122.hoa' '-atoms' '/tmp/LTL4353941258100450734.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4353941258100450734.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5966611062119155122.hoa
Detected timeout of ITS tools.
[2026-05-23 17:35:09] [INFO ] Flatten gal took : 90 ms
[2026-05-23 17:35:09] [INFO ] Flatten gal took : 106 ms
[2026-05-23 17:35:09] [INFO ] Time to serialize gal into /tmp/LTL13799905059611263041.gal : 23 ms
[2026-05-23 17:35:09] [INFO ] Time to serialize properties into /tmp/LTL13897988262985249407.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13799905059611263041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13897988262985249407.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(TrainState_3_0_0==1)")))||(G(("(TrainState_17_1_1==1)")||(G("(TrainState_19_2_5==1)"))))))))
Formula 0 simplified : XX(GF!"(TrainState_3_0_0==1)" & F(!"(TrainState_17_1_1==1)" & F!"(TrainState_19_2_5==1)"))
Detected timeout of ITS tools.
[2026-05-23 17:35:24] [INFO ] Flatten gal took : 69 ms
[2026-05-23 17:35:24] [INFO ] Applying decomposition
[2026-05-23 17:35:24] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5068737387310027398.txt' '-o' '/tmp/graph5068737387310027398.bin' '-w' '/tmp/graph5068737387310027398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5068737387310027398.bin' '-l' '-1' '-v' '-w' '/tmp/graph5068737387310027398.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:35:24] [INFO ] Decomposing Gal with order
[2026-05-23 17:35:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:35:25] [INFO ] Removed a total of 1528 redundant transitions.
[2026-05-23 17:35:25] [INFO ] Flatten gal took : 210 ms
[2026-05-23 17:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 864 labels/synchronizations in 29 ms.
[2026-05-23 17:35:26] [INFO ] Time to serialize gal into /tmp/LTL4295003121590069425.gal : 26 ms
[2026-05-23 17:35:26] [INFO ] Time to serialize properties into /tmp/LTL6051367427046592014.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4295003121590069425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6051367427046592014.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i16.u40.TrainState_3_0_0==1)")))||(G(("(i32.u20.TrainState_17_1_1==1)")||(G("(i38.u68.TrainState_19_2_5==1)"))))))))
Formula 0 simplified : XX(GF!"(i16.u40.TrainState_3_0_0==1)" & F(!"(i32.u20.TrainState_17_1_1==1)" & F!"(i38.u68.TrainState_19_2_5==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
116 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.60728,39452,1,0,8786,1160,3411,13557,527,2698,18614
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-040-LTLFireability-09 finished in 125144 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(p0)||X(X(X(X(X(G(p1))))))))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3639 place count 2921 transition count 5721
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4718 place count 2921 transition count 5721
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4878 place count 2761 transition count 5561
Iterating global reduction 0 with 160 rules applied. Total rules applied 5038 place count 2761 transition count 5561
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5158 place count 2641 transition count 5441
Iterating global reduction 0 with 120 rules applied. Total rules applied 5278 place count 2641 transition count 5441
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5398 place count 2521 transition count 5321
Iterating global reduction 0 with 120 rules applied. Total rules applied 5518 place count 2521 transition count 5321
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5638 place count 2401 transition count 5201
Iterating global reduction 0 with 120 rules applied. Total rules applied 5758 place count 2401 transition count 5201
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5878 place count 2281 transition count 5081
Iterating global reduction 0 with 120 rules applied. Total rules applied 5998 place count 2281 transition count 5081
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6117 place count 2162 transition count 4962
Iterating global reduction 0 with 119 rules applied. Total rules applied 6236 place count 2162 transition count 4962
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6316 place count 2082 transition count 4882
Iterating global reduction 0 with 80 rules applied. Total rules applied 6396 place count 2082 transition count 4882
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6476 place count 2002 transition count 4802
Iterating global reduction 0 with 80 rules applied. Total rules applied 6556 place count 2002 transition count 4802
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6596 place count 1962 transition count 4762
Iterating global reduction 0 with 40 rules applied. Total rules applied 6636 place count 1962 transition count 4762
Applied a total of 6636 rules in 3113 ms. Remains 1962 /5280 variables (removed 3318) and now considering 4762/8080 (removed 3318) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14129088462340971491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13316109936705618468.kers'
[2026-05-23 17:35:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14129088462340971491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13316109936705618468.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4762 rows 1962 cols 9524 entries
Finished phase 1 with 1922 SingleSign rule and 0 generalized
[2026-05-23 17:35:30] [INFO ] Computed 40 invariants in 29 ms
Computed 40 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-13316109936705618468.kers
Total runtime 36 ms.
[2026-05-23 17:35:31] [INFO ] Implicit Places using invariants in 528 ms returned []
[2026-05-23 17:35:31] [INFO ] Invariant cache hit.
[2026-05-23 17:35:33] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
Running 3322 sub problems to find dead transitions.
[2026-05-23 17:35:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1922/6724 variables, and 0 constraints, problems are : Problem set: 0 solved, 3322 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1962 constraints, PredecessorRefiner: 3322/3322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1922/6724 variables, and 0 constraints, problems are : Problem set: 0 solved, 3322 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1962 constraints, PredecessorRefiner: 0/3322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61785ms problems are : Problem set: 0 solved, 3322 unsolved
Search for dead transitions found 0 dead transitions in 61800ms
Starting structural reductions in LTL mode, iteration 1 : 1962/5280 places, 4762/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67706 ms. Remains : 1962/5280 places, 4762/8080 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)||X(X(X(X(X(G(p1))))))))'
Stuttering acceptance computed with spot in 558 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4498 steps with 0 reset in 33 ms.
FORMULA BART-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-10 finished in 68348 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)))'
Support contains 1 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3637 place count 2922 transition count 5722
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4716 place count 2922 transition count 5722
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4875 place count 2763 transition count 5563
Iterating global reduction 0 with 159 rules applied. Total rules applied 5034 place count 2763 transition count 5563
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5153 place count 2644 transition count 5444
Iterating global reduction 0 with 119 rules applied. Total rules applied 5272 place count 2644 transition count 5444
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5391 place count 2525 transition count 5325
Iterating global reduction 0 with 119 rules applied. Total rules applied 5510 place count 2525 transition count 5325
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5629 place count 2406 transition count 5206
Iterating global reduction 0 with 119 rules applied. Total rules applied 5748 place count 2406 transition count 5206
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5867 place count 2287 transition count 5087
Iterating global reduction 0 with 119 rules applied. Total rules applied 5986 place count 2287 transition count 5087
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6105 place count 2168 transition count 4968
Iterating global reduction 0 with 119 rules applied. Total rules applied 6224 place count 2168 transition count 4968
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6303 place count 2089 transition count 4889
Iterating global reduction 0 with 79 rules applied. Total rules applied 6382 place count 2089 transition count 4889
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6461 place count 2010 transition count 4810
Iterating global reduction 0 with 79 rules applied. Total rules applied 6540 place count 2010 transition count 4810
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 6579 place count 1971 transition count 4771
Iterating global reduction 0 with 39 rules applied. Total rules applied 6618 place count 1971 transition count 4771
Applied a total of 6618 rules in 3247 ms. Remains 1971 /5280 variables (removed 3309) and now considering 4771/8080 (removed 3309) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8735968456813671319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15805753483094058271.kers'
[2026-05-23 17:36:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8735968456813671319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15805753483094058271.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4771 rows 1971 cols 9542 entries
Finished phase 1 with 1931 SingleSign rule and 0 generalized
[2026-05-23 17:36:39] [INFO ] Computed 40 invariants in 17 ms
Computed 40 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-15805753483094058271.kers
Total runtime 22 ms.
[2026-05-23 17:36:39] [INFO ] Implicit Places using invariants in 408 ms returned []
[2026-05-23 17:36:39] [INFO ] Invariant cache hit.
[2026-05-23 17:36:42] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 2790 ms to find 0 implicit places.
Running 3331 sub problems to find dead transitions.
[2026-05-23 17:36:42] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1931/6742 variables, and 0 constraints, problems are : Problem set: 0 solved, 3331 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1971 constraints, PredecessorRefiner: 3331/3331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3331 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1931/6742 variables, and 0 constraints, problems are : Problem set: 0 solved, 3331 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1971 constraints, PredecessorRefiner: 0/3331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61942ms problems are : Problem set: 0 solved, 3331 unsolved
Search for dead transitions found 0 dead transitions in 61952ms
Starting structural reductions in LTL mode, iteration 1 : 1971/5280 places, 4771/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68001 ms. Remains : 1971/5280 places, 4771/8080 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)))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 4782 ms.
Product exploration explored 100000 steps with 50000 reset in 4797 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 3 factoid took 16 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 1714 ms.
FORMULA BART-PT-040-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-11 finished in 79423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G((X(p0)||(p1&&F(p2))))||X(p1))))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3638 place count 2921 transition count 5721
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4718 place count 2921 transition count 5721
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4877 place count 2762 transition count 5562
Iterating global reduction 0 with 159 rules applied. Total rules applied 5036 place count 2762 transition count 5562
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5155 place count 2643 transition count 5443
Iterating global reduction 0 with 119 rules applied. Total rules applied 5274 place count 2643 transition count 5443
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5393 place count 2524 transition count 5324
Iterating global reduction 0 with 119 rules applied. Total rules applied 5512 place count 2524 transition count 5324
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5631 place count 2405 transition count 5205
Iterating global reduction 0 with 119 rules applied. Total rules applied 5750 place count 2405 transition count 5205
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5869 place count 2286 transition count 5086
Iterating global reduction 0 with 119 rules applied. Total rules applied 5988 place count 2286 transition count 5086
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6107 place count 2167 transition count 4967
Iterating global reduction 0 with 119 rules applied. Total rules applied 6226 place count 2167 transition count 4967
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6305 place count 2088 transition count 4888
Iterating global reduction 0 with 79 rules applied. Total rules applied 6384 place count 2088 transition count 4888
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6463 place count 2009 transition count 4809
Iterating global reduction 0 with 79 rules applied. Total rules applied 6542 place count 2009 transition count 4809
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6582 place count 1969 transition count 4769
Iterating global reduction 0 with 40 rules applied. Total rules applied 6622 place count 1969 transition count 4769
Applied a total of 6622 rules in 3051 ms. Remains 1969 /5280 variables (removed 3311) and now considering 4769/8080 (removed 3311) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3259776806020902708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7385714573510810320.kers'
[2026-05-23 17:37:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3259776806020902708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7385714573510810320.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4769 rows 1969 cols 9538 entries
Finished phase 1 with 1929 SingleSign rule and 0 generalized
[2026-05-23 17:37:58] [INFO ] Computed 40 invariants in 29 ms
Computed 40 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-7385714573510810320.kers
Total runtime 34 ms.
[2026-05-23 17:37:59] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-23 17:37:59] [INFO ] Invariant cache hit.
[2026-05-23 17:38:01] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
Running 3329 sub problems to find dead transitions.
[2026-05-23 17:38:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1929/6738 variables, and 0 constraints, problems are : Problem set: 0 solved, 3329 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1969 constraints, PredecessorRefiner: 3329/3329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1929/6738 variables, and 0 constraints, problems are : Problem set: 0 solved, 3329 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1969 constraints, PredecessorRefiner: 0/3329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61569ms problems are : Problem set: 0 solved, 3329 unsolved
Search for dead transitions found 0 dead transitions in 61576ms
Starting structural reductions in LTL mode, iteration 1 : 1969/5280 places, 4769/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67243 ms. Remains : 1969/5280 places, 4769/8080 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G((X(p0)||(p1&&F(p2))))||X(p1))))))'
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p2) (NOT p0)), true, (AND p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-12
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-12 finished in 67805 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(p0)||X((p1||(p2 U (p3||G(p2)))))))'
Support contains 4 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 3499 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12971332420873882523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-651357996909219027.kers'
[2026-05-23 17:39:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12971332420873882523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-651357996909219027.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4760 rows 1960 cols 9520 entries
Finished phase 1 with 1920 SingleSign rule and 0 generalized
[2026-05-23 17:39:06] [INFO ] Computed 40 invariants in 18 ms
Computed 40 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-651357996909219027.kers
Total runtime 25 ms.
[2026-05-23 17:39:07] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-05-23 17:39:07] [INFO ] Invariant cache hit.
[2026-05-23 17:39:09] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 17:39:09] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/6720 variables, and 0 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/6720 variables, and 0 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61551ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61559ms
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67585 ms. Remains : 1960/5280 places, 4760/8080 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)||X((p1||(p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-15
Entered a terminal (fully accepting) state of product in 393 steps with 34 reset in 8 ms.
FORMULA BART-PT-040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-15 finished in 67923 ms.
All properties solved by simple procedures.
Total runtime 1820493 ms.

BK_STOP 1779558011309

--------------------
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-040"
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-040, 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-177946788100268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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