About the Execution of ITS-Tools for CANInsertWithFailure-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.472 | 3600000.00 | 5998052.00 | 358533.90 | FFFFTFF?F?FFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100716.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 CANInsertWithFailure-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100716
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 6.3K Mar 6 09:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 09:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 6 09:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 201K Mar 6 09:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 09:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 6 09:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 CANInsertWithFailure-PT-020-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779666739101
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 23:52:20] [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-24 23:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 23:52:20] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-24 23:52:20] [INFO ] Transformed 1044 places.
[2026-05-24 23:52:20] [INFO ] Transformed 2520 transitions.
[2026-05-24 23:52:20] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 125 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (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-6865883496252589897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14315126532599913404.kers'
[2026-05-24 23:52:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6865883496252589897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14315126532599913404.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2520 rows 1043 cols 5200 entries
Finished phase 1 with 1001 SingleSign rule and 20 generalized
[2026-05-24 23:52:20] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-14315126532599913404.kers
Total runtime 25 ms.
[2026-05-24 23:52:21] [INFO ] Implicit Places using invariants in 651 ms returned []
[2026-05-24 23:52:21] [INFO ] Invariant cache hit.
[2026-05-24 23:52:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-24 23:52:24] [INFO ] Implicit Places using invariants and state equation in 2982 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2026-05-24 23:52:24] [INFO ] Invariant cache hit.
[2026-05-24 23:52:24] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30963ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30990ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34829 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 170 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2026-05-24 23:52:55] [INFO ] Invariant cache hit.
[2026-05-24 23:52:55] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 23:52:55] [INFO ] Invariant cache hit.
[2026-05-24 23:52:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-24 23:52:59] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 3387 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3560 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Support contains 41 out of 1043 places after structural reductions.
[2026-05-24 23:52:59] [INFO ] Flatten gal took : 144 ms
[2026-05-24 23:52:59] [INFO ] Flatten gal took : 95 ms
[2026-05-24 23:52:59] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 36 out of 1043 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (81 resets) in 1429 ms. (27 steps per ms) remains 0/30 properties
FORMULA CANInsertWithFailure-PT-020-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 140 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(((p0 U (G(p0)||(p0&&(p1||X(p1))))) U p2)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2026-05-24 23:53:00] [INFO ] Invariant cache hit.
[2026-05-24 23:53:00] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-24 23:53:00] [INFO ] Invariant cache hit.
[2026-05-24 23:53:01] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-24 23:53:04] [INFO ] Implicit Places using invariants and state equation in 3582 ms returned []
Implicit Place search using SMT with State Equation took 3884 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3903 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||(p0&&(p1||X(p1))))) U p2)))'
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-00 finished in 4268 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 U (p1||G(!p0))))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 272 place count 907 transition count 2384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 272 place count 907 transition count 2383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1032 place count 527 transition count 2004
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1374 place count 527 transition count 1662
Applied a total of 1374 rules in 258 ms. Remains 527 /1043 variables (removed 516) and now considering 1662/2520 (removed 858) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4539233647509018092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12707075089263465289.kers'
[2026-05-24 23:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4539233647509018092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12707075089263465289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1662 rows 527 cols 3465 entries
Finished phase 1 with 485 SingleSign rule and 20 generalized
[2026-05-24 23:53:05] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12707075089263465289.kers
Total runtime 11 ms.
[2026-05-24 23:53:05] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-24 23:53:05] [INFO ] Invariant cache hit.
[2026-05-24 23:53:05] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2026-05-24 23:53:07] [INFO ] Implicit Places using invariants and state equation in 2439 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2026-05-24 23:53:07] [INFO ] Redundant transitions in 93 ms returned []
Running 1642 sub problems to find dead transitions.
[2026-05-24 23:53:07] [INFO ] Invariant cache hit.
[2026-05-24 23:53:07] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/2189 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/527 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/2189 variables, and 150 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/527 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 128/128 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 527/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63454 ms. Remains : 527/1043 places, 1662/2520 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 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-02
Product exploration explored 100000 steps with 1029 reset in 539 ms.
Product exploration explored 100000 steps with 1016 reset in 535 ms.
Computed a total of 63 stabilizing places and 102 stable transitions
Computed a total of 63 stabilizing places and 102 stable transitions
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 5261 steps (49 resets) in 78 ms. (66 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 416 ms.
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 1662/1662 transitions.
Applied a total of 0 rules in 38 ms. Remains 527 /527 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2026-05-24 23:54:10] [INFO ] Invariant cache hit.
[2026-05-24 23:54:10] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-24 23:54:10] [INFO ] Invariant cache hit.
[2026-05-24 23:54:10] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2026-05-24 23:54:12] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
[2026-05-24 23:54:12] [INFO ] Redundant transitions in 97 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2730 ms. Remains : 527/527 places, 1662/1662 transitions.
Computed a total of 63 stabilizing places and 102 stable transitions
Computed a total of 63 stabilizing places and 102 stable transitions
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 5122 steps (48 resets) in 52 ms. (96 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 382 ms.
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1011 reset in 414 ms.
Stack based approach found an accepted trace after 79265 steps with 803 reset with depth 59 and stack size 59 in 341 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-02 finished in 69244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions (Redundant composition of simpler transitions.) removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Applied a total of 1379 rules in 104 ms. Remains 524 /1043 variables (removed 519) and now considering 1660/2520 (removed 860) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11184664447844961887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-905331767540796757.kers'
[2026-05-24 23:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11184664447844961887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-905331767540796757.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1660 rows 524 cols 3460 entries
Finished phase 1 with 482 SingleSign rule and 20 generalized
[2026-05-24 23:54:14] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-905331767540796757.kers
Total runtime 13 ms.
[2026-05-24 23:54:14] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-24 23:54:14] [INFO ] Invariant cache hit.
[2026-05-24 23:54:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2026-05-24 23:54:17] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned []
Implicit Place search using SMT with State Equation took 2866 ms to find 0 implicit places.
[2026-05-24 23:54:17] [INFO ] Redundant transitions in 38 ms returned []
Running 1640 sub problems to find dead transitions.
[2026-05-24 23:54:17] [INFO ] Invariant cache hit.
[2026-05-24 23:54:17] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2184 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/2184 variables, and 140 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 118/118 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 524/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63410 ms. Remains : 524/1043 places, 1660/2520 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 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-03
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-03 finished in 63478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (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-4616920831122477597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5908934005364559448.kers'
[2026-05-24 23:55:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4616920831122477597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5908934005364559448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2520 rows 1043 cols 5200 entries
Finished phase 1 with 1001 SingleSign rule and 20 generalized
[2026-05-24 23:55:17] [INFO ] Computed 22 invariants in 15 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-5908934005364559448.kers
Total runtime 17 ms.
[2026-05-24 23:55:17] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-24 23:55:17] [INFO ] Invariant cache hit.
[2026-05-24 23:55:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-24 23:55:21] [INFO ] Implicit Places using invariants and state equation in 3482 ms returned []
Implicit Place search using SMT with State Equation took 3816 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2026-05-24 23:55:21] [INFO ] Invariant cache hit.
[2026-05-24 23:55:21] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30589ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30594ms
Finished structural reductions in LTL mode , in 1 iterations and 34440 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-05 finished in 34623 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((G(F(p1))||(F(p1)&&G(!p2)))) U (p3||G(p4))))))'
Support contains 7 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 1 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 2 with 754 rules applied. Total rules applied 1030 place count 528 transition count 2005
Drop transitions (Redundant composition of simpler transitions.) removed 339 transitions
Redundant transition composition rules discarded 339 transitions
Iterating global reduction 2 with 339 rules applied. Total rules applied 1369 place count 528 transition count 1666
Applied a total of 1369 rules in 98 ms. Remains 528 /1043 variables (removed 515) and now considering 1666/2520 (removed 854) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1875647074362943247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8138949438802096165.kers'
[2026-05-24 23:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1875647074362943247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8138949438802096165.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1666 rows 528 cols 3472 entries
Finished phase 1 with 486 SingleSign rule and 20 generalized
[2026-05-24 23:55:52] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8138949438802096165.kers
Total runtime 14 ms.
[2026-05-24 23:55:52] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-24 23:55:52] [INFO ] Invariant cache hit.
[2026-05-24 23:55:52] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2026-05-24 23:55:54] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2026-05-24 23:55:54] [INFO ] Redundant transitions in 26 ms returned []
Running 1646 sub problems to find dead transitions.
[2026-05-24 23:55:54] [INFO ] Invariant cache hit.
[2026-05-24 23:55:54] [INFO ] State equation strengthened by 1175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/2194 variables, and 62 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/528 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/2194 variables, and 134 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/528 constraints, ReadFeed: 0/1175 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 528/1043 places, 1666/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63153 ms. Remains : 528/1043 places, 1666/2520 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((G(F(p0))||(F(p0)&&G(!p1)))) U (p2||G(p3)))||p4)))'
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 964 reset in 457 ms.
Product exploration explored 100000 steps with 951 reset in 506 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge based reduction with 43 factoid took 109 ms. Reduced automaton from 8 states, 36 edges and 5 AP (stutter insensitive) to 8 states, 36 edges and 5 AP (stutter insensitive).
RANDOM walk for 40000 steps (381 resets) in 408 ms. (97 steps per ms) remains 9/29 properties
BEST_FIRST walk for 40004 steps (15 resets) in 135 ms. (294 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (16 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 146 ms. (272 steps per ms) remains 2/6 properties
[2026-05-24 23:56:57] [INFO ] Invariant cache hit.
[2026-05-24 23:56:57] [INFO ] State equation strengthened by 1175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 484/488 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/524 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/526 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2192 variables, 526/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2192 variables, 1175/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2192 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2194 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2194 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2194 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 1743 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3653 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 528/528 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 484/488 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/524 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/526 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1666/2192 variables, 526/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2192 variables, 1175/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2192 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2192 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/2194 variables, 2/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2194 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2194 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 1745 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 528/528 constraints, ReadFeed: 1175/1175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5016ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 6 ms.
Knowledge based reduction with 43 factoid took 574 ms. Reduced automaton from 8 states, 36 edges and 5 AP (stutter insensitive) to 8 states, 36 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2026-05-24 23:57:03] [INFO ] Invariant cache hit.
[2026-05-24 23:57:03] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2026-05-24 23:57:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-24 23:57:03] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2026-05-24 23:57:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:57:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-24 23:57:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-24 23:57:04] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2026-05-24 23:57:04] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2026-05-24 23:57:05] [INFO ] [Nat]Added 1175 Read/Feed constraints in 293 ms returned sat
[2026-05-24 23:57:05] [INFO ] Computed and/alt/rep : 1586/4236/1586 causal constraints (skipped 60 transitions) in 84 ms.
[2026-05-24 23:57:06] [INFO ] Added : 56 causal constraints over 12 iterations in 1177 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3) (NOT p4))
Knowledge-based reduction took 9593 ms.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 1666/1666 transitions.
Applied a total of 0 rules in 30 ms. Remains 528 /528 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2026-05-24 23:57:06] [INFO ] Invariant cache hit.
[2026-05-24 23:57:06] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-24 23:57:06] [INFO ] Invariant cache hit.
[2026-05-24 23:57:07] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2026-05-24 23:57:09] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2026-05-24 23:57:09] [INFO ] Redundant transitions in 21 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2715 ms. Remains : 528/528 places, 1666/1666 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge based reduction with 43 factoid took 111 ms. Reduced automaton from 8 states, 36 edges and 5 AP (stutter insensitive) to 8 states, 36 edges and 5 AP (stutter insensitive).
RANDOM walk for 40000 steps (384 resets) in 353 ms. (112 steps per ms) remains 9/29 properties
BEST_FIRST walk for 40004 steps (18 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (17 resets) in 57 ms. (689 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (17 resets) in 54 ms. (727 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 38946 steps (17 resets) in 43 ms. (885 steps per ms) remains 0/4 properties
Knowledge based reduction with 43 factoid took 593 ms. Reduced automaton from 8 states, 36 edges and 5 AP (stutter insensitive) to 8 states, 36 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2026-05-24 23:57:10] [INFO ] Invariant cache hit.
[2026-05-24 23:57:11] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2026-05-24 23:57:11] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 23:57:11] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2026-05-24 23:57:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:57:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-24 23:57:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 23:57:12] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2026-05-24 23:57:12] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2026-05-24 23:57:12] [INFO ] [Nat]Added 1175 Read/Feed constraints in 312 ms returned sat
[2026-05-24 23:57:12] [INFO ] Computed and/alt/rep : 1586/4236/1586 causal constraints (skipped 60 transitions) in 83 ms.
[2026-05-24 23:57:13] [INFO ] Added : 56 causal constraints over 12 iterations in 1206 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3) (NOT p4))
Knowledge-based reduction took 4517 ms.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 960 reset in 438 ms.
Product exploration explored 100000 steps with 962 reset in 465 ms.
Built C files in :
/tmp/ltsmin14974866772968047570
[2026-05-24 23:57:15] [INFO ] Too many transitions (1666) to apply POR reductions. Disabling POR matrices.
[2026-05-24 23:57:15] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14974866772968047570
Running compilation step : cd /tmp/ltsmin14974866772968047570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2952 ms.
Running link step : cd /tmp/ltsmin14974866772968047570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14974866772968047570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5452453796130027399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 1666/1666 transitions.
Applied a total of 0 rules in 26 ms. Remains 528 /528 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2026-05-24 23:57:30] [INFO ] Invariant cache hit.
[2026-05-24 23:57:30] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 23:57:30] [INFO ] Invariant cache hit.
[2026-05-24 23:57:31] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2026-05-24 23:57:33] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
[2026-05-24 23:57:33] [INFO ] Redundant transitions in 23 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2691 ms. Remains : 528/528 places, 1666/1666 transitions.
Built C files in :
/tmp/ltsmin12933068361506295597
[2026-05-24 23:57:33] [INFO ] Too many transitions (1666) to apply POR reductions. Disabling POR matrices.
[2026-05-24 23:57:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12933068361506295597
Running compilation step : cd /tmp/ltsmin12933068361506295597;'/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/ltsmin12933068361506295597;'/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/ltsmin12933068361506295597;'/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-24 23:57:36] [INFO ] Flatten gal took : 40 ms
[2026-05-24 23:57:36] [INFO ] Flatten gal took : 40 ms
[2026-05-24 23:57:36] [INFO ] Time to serialize gal into /tmp/LTL13566106532211591605.gal : 12 ms
[2026-05-24 23:57:36] [INFO ] Time to serialize properties into /tmp/LTL1155828993998147893.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/LTL13566106532211591605.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12415969333064997854.hoa' '-atoms' '/tmp/LTL1155828993998147893.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/LTL1155828993998147893.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12415969333064997854.hoa
Detected timeout of ITS tools.
[2026-05-24 23:57:51] [INFO ] Flatten gal took : 32 ms
[2026-05-24 23:57:51] [INFO ] Flatten gal took : 34 ms
[2026-05-24 23:57:51] [INFO ] Time to serialize gal into /tmp/LTL961019427981777917.gal : 10 ms
[2026-05-24 23:57:51] [INFO ] Time to serialize properties into /tmp/LTL5498484794611276002.ltl : 2 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/LTL961019427981777917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5498484794611276002.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...274
Read 1 LTL properties
Checking formula 0 : !((G(((F((G(F("(Node0GiveAnswer11<1)")))||((F("(Node0GiveAnswer11<1)"))&&(G(!("((Node2IsInserted>=1)&&(Node9requestsent2>=1))"))))))U(...268
Formula 0 simplified : F(!"((Node1IsInserted>=1)&&(Node6requestsent1>=1))" & (G(FG!"(Node0GiveAnswer11<1)" & (G!"(Node0GiveAnswer11<1)" | F"((Node2IsInsert...249
Detected timeout of ITS tools.
[2026-05-24 23:58:06] [INFO ] Flatten gal took : 27 ms
[2026-05-24 23:58:06] [INFO ] Applying decomposition
[2026-05-24 23:58:06] [INFO ] Flatten gal took : 28 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/graph656389004923041839.txt' '-o' '/tmp/graph656389004923041839.bin' '-w' '/tmp/graph656389004923041839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph656389004923041839.bin' '-l' '-1' '-v' '-w' '/tmp/graph656389004923041839.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:58:06] [INFO ] Decomposing Gal with order
[2026-05-24 23:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:58:07] [INFO ] Removed a total of 1203 redundant transitions.
[2026-05-24 23:58:07] [INFO ] Flatten gal took : 309 ms
[2026-05-24 23:58:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 51 ms.
[2026-05-24 23:58:07] [INFO ] Time to serialize gal into /tmp/LTL9164551493089724884.gal : 14 ms
[2026-05-24 23:58:07] [INFO ] Time to serialize properties into /tmp/LTL10891566229156490909.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/LTL9164551493089724884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10891566229156490909.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 : !((G(((F((G(F("(u12.Node0GiveAnswer11<1)")))||((F("(u12.Node0GiveAnswer11<1)"))&&(G(!("((u3.Node2IsInserted>=1)&&(u10.Node9requestsent...295
Formula 0 simplified : F(!"((u2.Node1IsInserted>=1)&&(u7.Node6requestsent1>=1))" & (G(FG!"(u12.Node0GiveAnswer11<1)" & (G!"(u12.Node0GiveAnswer11<1)" | F"(...276
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-07 finished in 150285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (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-9675131586245166076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15680722880349469068.kers'
[2026-05-24 23:58:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9675131586245166076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15680722880349469068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2520 rows 1043 cols 5200 entries
Finished phase 1 with 1001 SingleSign rule and 20 generalized
[2026-05-24 23:58:22] [INFO ] Computed 22 invariants in 17 ms
Computed 22 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-15680722880349469068.kers
Total runtime 22 ms.
[2026-05-24 23:58:22] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-24 23:58:22] [INFO ] Invariant cache hit.
[2026-05-24 23:58:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-24 23:58:26] [INFO ] Implicit Places using invariants and state equation in 3398 ms returned []
Implicit Place search using SMT with State Equation took 3735 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2026-05-24 23:58:26] [INFO ] Invariant cache hit.
[2026-05-24 23:58:26] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30604ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Finished structural reductions in LTL mode , in 1 iterations and 34371 ms. Remains : 1043/1043 places, 2520/2520 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)))'
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1262 steps with 2 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-08 finished in 34523 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)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 0 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1040 place count 523 transition count 2000
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1382 place count 523 transition count 1658
Applied a total of 1382 rules in 89 ms. Remains 523 /1043 variables (removed 520) and now considering 1658/2520 (removed 862) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14437795056439261205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4852289751323771399.kers'
[2026-05-24 23:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14437795056439261205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4852289751323771399.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1658 rows 523 cols 3456 entries
Finished phase 1 with 481 SingleSign rule and 20 generalized
[2026-05-24 23:58:57] [INFO ] Computed 22 invariants in 9 ms
Computed 22 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4852289751323771399.kers
Total runtime 13 ms.
[2026-05-24 23:58:57] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-24 23:58:57] [INFO ] Invariant cache hit.
[2026-05-24 23:58:57] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2026-05-24 23:59:00] [INFO ] Implicit Places using invariants and state equation in 2755 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
[2026-05-24 23:59:00] [INFO ] Redundant transitions in 26 ms returned []
Running 1638 sub problems to find dead transitions.
[2026-05-24 23:59:00] [INFO ] Invariant cache hit.
[2026-05-24 23:59:00] [INFO ] State equation strengthened by 1178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2181 variables, and 62 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1178 constraints, PredecessorRefiner: 1638/1638 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
SMT process timed out in 60477ms, After SMT, problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 523/1043 places, 1658/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63574 ms. Remains : 523/1043 places, 1658/2520 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)))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 980 reset in 415 ms.
Product exploration explored 100000 steps with 988 reset in 472 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge based reduction with 3 factoid took 56 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 6933 steps (63 resets) in 61 ms. (111 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 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 80 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 242 ms.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 25 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2026-05-25 00:00:01] [INFO ] Invariant cache hit.
[2026-05-25 00:00:02] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 00:00:02] [INFO ] Invariant cache hit.
[2026-05-25 00:00:02] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2026-05-25 00:00:04] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
[2026-05-25 00:00:04] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3017 ms. Remains : 523/523 places, 1658/1658 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge based reduction with 3 factoid took 67 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 8515 steps (81 resets) in 88 ms. (95 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 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 91 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 285 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 988 reset in 469 ms.
Product exploration explored 100000 steps with 982 reset in 477 ms.
Built C files in :
/tmp/ltsmin6317597413806510953
[2026-05-25 00:00:06] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2026-05-25 00:00:06] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6317597413806510953
Running compilation step : cd /tmp/ltsmin6317597413806510953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2783 ms.
Running link step : cd /tmp/ltsmin6317597413806510953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6317597413806510953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased715648676464725666.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 35 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2026-05-25 00:00:21] [INFO ] Invariant cache hit.
[2026-05-25 00:00:21] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-25 00:00:21] [INFO ] Invariant cache hit.
[2026-05-25 00:00:21] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2026-05-25 00:00:24] [INFO ] Implicit Places using invariants and state equation in 2850 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
[2026-05-25 00:00:24] [INFO ] Redundant transitions in 24 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3125 ms. Remains : 523/523 places, 1658/1658 transitions.
Built C files in :
/tmp/ltsmin12264887062611014814
[2026-05-25 00:00:24] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2026-05-25 00:00:24] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12264887062611014814
Running compilation step : cd /tmp/ltsmin12264887062611014814;'/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/ltsmin12264887062611014814;'/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/ltsmin12264887062611014814;'/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-25 00:00:27] [INFO ] Flatten gal took : 24 ms
[2026-05-25 00:00:27] [INFO ] Flatten gal took : 29 ms
[2026-05-25 00:00:27] [INFO ] Time to serialize gal into /tmp/LTL2545089346352768598.gal : 6 ms
[2026-05-25 00:00:27] [INFO ] Time to serialize properties into /tmp/LTL1139806373143825431.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/LTL2545089346352768598.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14925833844001346270.hoa' '-atoms' '/tmp/LTL1139806373143825431.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/LTL1139806373143825431.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14925833844001346270.hoa
Detected timeout of ITS tools.
[2026-05-25 00:00:42] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:00:42] [INFO ] Flatten gal took : 21 ms
[2026-05-25 00:00:42] [INFO ] Time to serialize gal into /tmp/LTL14639188990190039911.gal : 5 ms
[2026-05-25 00:00:42] [INFO ] Time to serialize properties into /tmp/LTL5369835123578376455.ltl : 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/LTL14639188990190039911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5369835123578376455.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 : !((G(F("(Node16GiveAnswer19<1)"))))
Formula 0 simplified : FG!"(Node16GiveAnswer19<1)"
Detected timeout of ITS tools.
[2026-05-25 00:00:57] [INFO ] Flatten gal took : 18 ms
[2026-05-25 00:00:57] [INFO ] Applying decomposition
[2026-05-25 00:00:57] [INFO ] Flatten gal took : 18 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/graph5723112670240541991.txt' '-o' '/tmp/graph5723112670240541991.bin' '-w' '/tmp/graph5723112670240541991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5723112670240541991.bin' '-l' '-1' '-v' '-w' '/tmp/graph5723112670240541991.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:00:57] [INFO ] Decomposing Gal with order
[2026-05-25 00:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:00:57] [INFO ] Removed a total of 1200 redundant transitions.
[2026-05-25 00:00:57] [INFO ] Flatten gal took : 82 ms
[2026-05-25 00:00:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 48 ms.
[2026-05-25 00:00:58] [INFO ] Time to serialize gal into /tmp/LTL9903625388096187997.gal : 8 ms
[2026-05-25 00:00:58] [INFO ] Time to serialize properties into /tmp/LTL2247397212138658307.ltl : 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/LTL9903625388096187997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2247397212138658307.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 : !((G(F("(u20.Node16GiveAnswer19<1)"))))
Formula 0 simplified : FG!"(u20.Node16GiveAnswer19<1)"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-09 finished in 136125 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)) U (G(p0)||F(p2))))))'
Support contains 2 out of 1043 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 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions (Redundant composition of simpler transitions.) removed 340 transitions
Redundant transition composition rules discarded 340 transitions
Iterating global reduction 2 with 340 rules applied. Total rules applied 1376 place count 525 transition count 1662
Applied a total of 1376 rules in 85 ms. Remains 525 /1043 variables (removed 518) and now considering 1662/2520 (removed 858) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17767813993113337183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15332125127692800480.kers'
[2026-05-25 00:01:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17767813993113337183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15332125127692800480.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1662 rows 525 cols 3464 entries
Finished phase 1 with 483 SingleSign rule and 20 generalized
[2026-05-25 00:01:13] [INFO ] Computed 22 invariants in 15 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-15332125127692800480.kers
Total runtime 20 ms.
[2026-05-25 00:01:13] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-25 00:01:13] [INFO ] Invariant cache hit.
[2026-05-25 00:01:13] [INFO ] State equation strengthened by 1176 read => feed constraints.
[2026-05-25 00:01:16] [INFO ] Implicit Places using invariants and state equation in 2896 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
[2026-05-25 00:01:16] [INFO ] Redundant transitions in 28 ms returned []
Running 1642 sub problems to find dead transitions.
[2026-05-25 00:01:16] [INFO ] Invariant cache hit.
[2026-05-25 00:01:16] [INFO ] State equation strengthened by 1176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2187 variables, and 62 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1176 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2187 variables, and 133 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1176 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63655 ms. Remains : 525/1043 places, 1662/2520 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)) U (G(p0)||F(p2))))))'
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-10
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-10 finished in 63774 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((X((G(!p1) U G(p2)))&&p0))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (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-12360118560141454689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14099421859605321244.kers'
[2026-05-25 00:02:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12360118560141454689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14099421859605321244.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2520 rows 1043 cols 5200 entries
Finished phase 1 with 1001 SingleSign rule and 20 generalized
[2026-05-25 00:02:16] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14099421859605321244.kers
Total runtime 18 ms.
[2026-05-25 00:02:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-25 00:02:17] [INFO ] Invariant cache hit.
[2026-05-25 00:02:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-25 00:02:20] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 3738 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2026-05-25 00:02:20] [INFO ] Invariant cache hit.
[2026-05-25 00:02:20] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30594ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30597ms
Finished structural reductions in LTL mode , in 1 iterations and 34364 ms. Remains : 1043/1043 places, 2520/2520 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((X((G(!p1) U G(p2)))&&p0))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-11
Stuttering criterion allowed to conclude after 1083 steps with 1 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-11 finished in 34661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(X(p1)&&F(p2))) U X(p3)))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2026-05-25 00:02:51] [INFO ] Invariant cache hit.
[2026-05-25 00:02:51] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 00:02:51] [INFO ] Invariant cache hit.
[2026-05-25 00:02:52] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-25 00:02:55] [INFO ] Implicit Places using invariants and state equation in 3372 ms returned []
Implicit Place search using SMT with State Equation took 3693 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3716 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(X(p1)&&F(p2))) U X(p3)))'
Stuttering acceptance computed with spot in 212 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-13
Stuttering criterion allowed to conclude after 440 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-13 finished in 3976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X(X((F(p2)||G(p3))))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2026-05-25 00:02:55] [INFO ] Invariant cache hit.
[2026-05-25 00:02:55] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-25 00:02:55] [INFO ] Invariant cache hit.
[2026-05-25 00:02:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-25 00:02:59] [INFO ] Implicit Places using invariants and state equation in 3335 ms returned []
Implicit Place search using SMT with State Equation took 3638 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3659 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X(X((F(p2)||G(p3))))))'
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-15
Stuttering criterion allowed to conclude after 359 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-15 finished in 4251 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((G(F(p1))||(F(p1)&&G(!p2)))) U (p3||G(p4))))))'
Spot run failed in 70 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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)))'
Spot run failed in 40 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 00:02:59] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10310171081548630103
[2026-05-25 00:02:59] [INFO ] Too many transitions (2520) to apply POR reductions. Disabling POR matrices.
[2026-05-25 00:02:59] [INFO ] Applying decomposition
[2026-05-25 00:02:59] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10310171081548630103
Running compilation step : cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-25 00:02:59] [INFO ] Flatten gal took : 28 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/graph1856357891944872723.txt' '-o' '/tmp/graph1856357891944872723.bin' '-w' '/tmp/graph1856357891944872723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1856357891944872723.bin' '-l' '-1' '-v' '-w' '/tmp/graph1856357891944872723.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:03:00] [INFO ] Decomposing Gal with order
[2026-05-25 00:03:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:03:00] [INFO ] Removed a total of 1203 redundant transitions.
[2026-05-25 00:03:00] [INFO ] Flatten gal took : 192 ms
[2026-05-25 00:03:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1105 labels/synchronizations in 64 ms.
[2026-05-25 00:03:00] [INFO ] Time to serialize gal into /tmp/LTLFireability1583888954523857702.gal : 29 ms
[2026-05-25 00:03:00] [INFO ] Time to serialize properties into /tmp/LTLFireability18299147478466568295.ltl : 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/LTLFireability1583888954523857702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18299147478466568295.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...277
Read 2 LTL properties
Checking formula 0 : !((G(("((i9.i0.u4.Node1IsInserted>=1)&&(u26.Node6requestsent1>=1))")||((F((G(F("(u45.Node0GiveAnswer11<1)")))||((F("(u45.Node0GiveAnsw...304
Formula 0 simplified : F(!"((i9.i0.u4.Node1IsInserted>=1)&&(u26.Node6requestsent1>=1))" & (G(FG!"(u45.Node0GiveAnswer11<1)" & (G!"(u45.Node0GiveAnswer11<1)...285
Compilation finished in 4867 ms.
Running link step : cd /tmp/ltsmin10310171081548630103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||(<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&[](!(LTLAPp2==true))))) U ((LTLAPp3==true)||[]((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||(<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&[](!(LTLAPp2==true))))) U ((LTLAPp3==true)||[]((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 00:26:34] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:26:34] [INFO ] Time to serialize gal into /tmp/LTLFireability2550941404998416349.gal : 7 ms
[2026-05-25 00:26:34] [INFO ] Time to serialize properties into /tmp/LTLFireability11688788902542694724.ltl : 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/LTLFireability2550941404998416349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11688788902542694724.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...298
Read 2 LTL properties
Checking formula 0 : !((G(("((Node1IsInserted>=1)&&(Node6requestsent1>=1))")||((F((G(F("(Node0GiveAnswer11<1)")))||((F("(Node0GiveAnswer11<1)"))&&(G(!("((N...268
Formula 0 simplified : F(!"((Node1IsInserted>=1)&&(Node6requestsent1>=1))" & (G(FG!"(Node0GiveAnswer11<1)" & (G!"(Node0GiveAnswer11<1)" | F"((Node2IsInsert...249
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10310171081548630103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||(<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&[](!(LTLAPp2==true))))) U ((LTLAPp3==true)||[]((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 00:50:23] [INFO ] Flatten gal took : 418 ms
[2026-05-25 00:50:25] [INFO ] Input system was already deterministic with 2520 transitions.
[2026-05-25 00:50:26] [INFO ] Transformed 1043 places.
[2026-05-25 00:50:26] [INFO ] Transformed 2520 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 00:50:26] [INFO ] Time to serialize gal into /tmp/LTLFireability12406941868996058211.gal : 27 ms
[2026-05-25 00:50:26] [INFO ] Time to serialize properties into /tmp/LTLFireability15604224124762029918.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/LTLFireability12406941868996058211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15604224124762029918.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((Node1IsInserted>=1)&&(Node6requestsent1>=1))")||((F((G(F("(Node0GiveAnswer11<1)")))||((F("(Node0GiveAnswer11<1)"))&&(G(!("((N...268
Formula 0 simplified : F(!"((Node1IsInserted>=1)&&(Node6requestsent1>=1))" & (G(FG!"(Node0GiveAnswer11<1)" & (G!"(Node0GiveAnswer11<1)" | F"((Node2IsInsert...249
BK_TIME_CONFINEMENT_REACHED
--------------------
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="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842100716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 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 '
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 ;