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.r162-smll-177961108000636.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 MAPKbis-PT-5310, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961108000636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.3K Mar 7 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 7 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 11:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 15 11:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 7 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 7 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 170K 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 MAPKbis-PT-5310-LTLFireability-00
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-01
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-02
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-03
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-04
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-05
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-06
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-07
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-08
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-09
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-10
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-11
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-12
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-13
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-14
FORMULA_NAME MAPKbis-PT-5310-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780021445220

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPKbis-PT-5310
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-29 02:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-29 02:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-29 02:24:07] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-29 02:24:07] [INFO ] Transformed 106 places.
[2026-05-29 02:24:07] [INFO ] Transformed 173 transitions.
[2026-05-29 02:24:07] [INFO ] Found NUPN structural information;
[2026-05-29 02:24:07] [INFO ] Parsed PT model containing 106 places and 173 transitions and 986 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 15 places and 41 transitions.
Reduce places removed 7 places and 0 transitions.
FORMULA MAPKbis-PT-5310-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 132/132 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 130
Applied a total of 2 rules in 54 ms. Remains 84 /84 variables (removed 0) and now considering 130/132 (removed 2) transitions.
[2026-05-29 02:24:08] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11460242463845992147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16793631491293502354.kers'
[2026-05-29 02:24:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11460242463845992147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16793631491293502354.kers]
Culling duplicate invariants (modulo rational): removing 42 columns.
Culled 42 columns in 0 ms.
// Phase 1: matrix 84 rows 42 cols 84 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-29 02:24:08] [INFO ] Computed 42 invariants in 0 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16793631491293502354.kers
Total runtime 3 ms.
[2026-05-29 02:24:08] [INFO ] Implicit Places using invariants in 467 ms returned []
[2026-05-29 02:24:08] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:08] [INFO ] Invariant cache hit.
[2026-05-29 02:24:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:08] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-29 02:24:08] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:08] [INFO ] Invariant cache hit.
[2026-05-29 02:24:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 42/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 42/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 253 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7393 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 42/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 42/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 129/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 382 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5553 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13070ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 13097ms
Starting structural reductions in LTL mode, iteration 1 : 84/84 places, 130/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14018 ms. Remains : 84/84 places, 130/132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:22] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:22] [INFO ] Invariant cache hit.
[2026-05-29 02:24:22] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-29 02:24:22] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:22] [INFO ] Invariant cache hit.
[2026-05-29 02:24:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:22] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 84/84 places, 130/130 transitions.
Support contains 38 out of 84 places after structural reductions.
[2026-05-29 02:24:22] [INFO ] Flatten gal took : 50 ms
[2026-05-29 02:24:22] [INFO ] Flatten gal took : 28 ms
[2026-05-29 02:24:22] [INFO ] Input system was already deterministic with 130 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (8 resets) in 1500 ms. (26 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
[2026-05-29 02:24:23] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:23] [INFO ] Invariant cache hit.
[2026-05-29 02:24:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/36 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/57 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/57 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/57 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 59/116 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/116 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/116 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/116 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/128 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/128 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 36/164 variables, 24/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/164 variables, 24/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 12/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/164 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/165 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/165 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/168 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/168 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/168 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/36 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 21/57 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/57 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 59/116 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/116 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/116 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/116 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/128 variables, 13/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/128 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/128 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 36/164 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 24/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/164 variables, 12/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/164 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/165 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/168 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/168 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/168 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 253 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 130/130 transitions.
Graph (complete) has 261 edges and 84 vertex of which 68 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 68 transition count 105
Applied a total of 20 rules in 31 ms. Remains 68 /84 variables (removed 16) and now considering 105/130 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 68/84 places, 105/130 transitions.
RANDOM walk for 40000 steps (8 resets) in 1095 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 918565 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 1
Probabilistic random walk after 918565 steps, saw 508162 distinct states, run finished after 3024 ms. (steps per millisecond=303 ) properties seen :0
[2026-05-29 02:24:27] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13599496087931321939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11860306483811936176.kers'
[2026-05-29 02:24:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13599496087931321939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11860306483811936176.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 68 rows 34 cols 68 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-29 02:24:27] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-11860306483811936176.kers
Total runtime 22 ms.
[2026-05-29 02:24:27] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/13 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/13 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/28 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/28 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/39 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/39 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 29/68 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/68 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/68 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/68 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/78 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/78 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 30/108 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/108 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/108 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/108 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/114 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/114 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 18/132 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/132 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/132 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/132 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/133 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/133 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 3/136 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/136 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/136 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/13 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/13 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/28 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/28 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/28 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/39 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/39 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/39 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/68 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/68 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/68 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/68 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/78 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/78 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/78 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 30/108 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/108 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/108 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/108 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/114 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/114 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 18/132 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/132 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/132 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/133 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/133 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 3/136 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/136 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/136 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 105/105 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 68/68 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 105/105 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2026-05-29 02:24:28] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
[2026-05-29 02:24:28] [INFO ] Invariant cache hit.
[2026-05-29 02:24:28] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-29 02:24:28] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
[2026-05-29 02:24:28] [INFO ] Invariant cache hit.
[2026-05-29 02:24:28] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-29 02:24:28] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2026-05-29 02:24:28] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-29 02:24:28] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
[2026-05-29 02:24:28] [INFO ] Invariant cache hit.
[2026-05-29 02:24:28] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 34/102 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 34/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 205 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4569 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 34/102 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 34/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 104/309 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 309 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3714 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8317ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 8319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8729 ms. Remains : 68/68 places, 105/105 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 99 edges and 68 vertex of which 64 / 68 are part of one of the 32 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 4 edges and 36 vertex of which 4 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 24 ms. Remains 4 /68 variables (removed 64) and now considering 4/105 (removed 101) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4687659905464059018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16053196336936423746.kers'
[2026-05-29 02:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4687659905464059018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16053196336936423746.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-29 02:24:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16053196336936423746.kers
Total runtime 1 ms.
[2026-05-29 02:24:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-29 02:24:36] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-29 02:24:36] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-29 02:24:36] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-29 02:24:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-29 02:24:36] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-29 02:24:36] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-29 02:24:36] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 14 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:37] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9112948050691703331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10372233679880203889.kers'
[2026-05-29 02:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9112948050691703331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10372233679880203889.kers]
Culling duplicate invariants (modulo rational): removing 42 columns.
Culled 42 columns in 0 ms.
// Phase 1: matrix 84 rows 42 cols 84 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-29 02:24:37] [INFO ] Computed 42 invariants in 0 ms
Computed 42 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10372233679880203889.kers
Total runtime 1 ms.
[2026-05-29 02:24:37] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-29 02:24:37] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:37] [INFO ] Invariant cache hit.
[2026-05-29 02:24:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:38] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2026-05-29 02:24:38] [INFO ] Redundant transitions in 6 ms returned []
Running 129 sub problems to find dead transitions.
[2026-05-29 02:24:38] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:38] [INFO ] Invariant cache hit.
[2026-05-29 02:24:38] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 42/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 42/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 253 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6352 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 42/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 42/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 129/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 382 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5917 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12295ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 12298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12910 ms. Remains : 84/84 places, 130/130 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 433 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-00
Product exploration explored 100000 steps with 1463 reset in 717 ms.
Stack based approach found an accepted trace after 227 steps with 4 reset with depth 14 and stack size 14 in 4 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPKbis-PT-5310-LTLFireability-00 finished in 14240 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((!p0||F(!p1))))&&F(G(p1))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:51] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:51] [INFO ] Invariant cache hit.
[2026-05-29 02:24:51] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-29 02:24:51] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:51] [INFO ] Invariant cache hit.
[2026-05-29 02:24:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:52] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 84/84 places, 130/130 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((!p0||F(!p1))))&&F(G(p1))))'
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) p0), (AND p1 p0), (NOT p1), (AND p0 p1), p1]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 299 ms.
Stack based approach found an accepted trace after 355 steps with 1 reset with depth 354 and stack size 354 in 3 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPKbis-PT-5310-LTLFireability-01 finished in 1054 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) U ((p1 U p2)||X((!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:52] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:52] [INFO ] Invariant cache hit.
[2026-05-29 02:24:52] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-29 02:24:52] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:52] [INFO ] Invariant cache hit.
[2026-05-29 02:24:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:53] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 84/84 places, 130/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U ((p1 U p2)||X((!p2 U (p3||G(!p2)))))))'
Stuttering acceptance computed with spot in 345 ms :[true, false, p0, false, false, (AND p0 p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 33 factoid took 19 ms. Proved property starting from automaton with 7 states, 19 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPKbis-PT-5310-LTLFireability-02 finished in 1614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:54] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:54] [INFO ] Invariant cache hit.
[2026-05-29 02:24:54] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-29 02:24:54] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:54] [INFO ] Invariant cache hit.
[2026-05-29 02:24:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:54] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2026-05-29 02:24:54] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 84/84 places, 130/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-03
Product exploration explored 100000 steps with 104 reset in 388 ms.
Stack based approach found an accepted trace after 233 steps with 0 reset with depth 234 and stack size 234 in 2 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPKbis-PT-5310-LTLFireability-03 finished in 764 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) U X((p1 U X(p2))))||X(X(X(G(p2)))))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:55] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:55] [INFO ] Invariant cache hit.
[2026-05-29 02:24:55] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-29 02:24:55] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:55] [INFO ] Invariant cache hit.
[2026-05-29 02:24:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:55] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 84/84 places, 130/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X((p1 U X(p2))))||X(X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 736 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPKbis-PT-5310-LTLFireability-04 finished in 1322 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 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:56] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:56] [INFO ] Invariant cache hit.
[2026-05-29 02:24:56] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-29 02:24:56] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:56] [INFO ] Invariant cache hit.
[2026-05-29 02:24:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:56] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2026-05-29 02:24:56] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 84/84 places, 130/130 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 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-05
Product exploration explored 100000 steps with 203 reset in 377 ms.
Product exploration explored 100000 steps with 184 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 78 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 3854 steps (0 resets) in 54 ms. (70 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 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 71 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 247 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:24:58] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:58] [INFO ] Invariant cache hit.
[2026-05-29 02:24:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-29 02:24:58] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:24:58] [INFO ] Invariant cache hit.
[2026-05-29 02:24:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:24:58] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2026-05-29 02:24:58] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 84/84 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 48 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 1443 steps (0 resets) in 11 ms. (120 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 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 79 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 191 ms.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 179 reset in 412 ms.
Product exploration explored 100000 steps with 166 reset in 479 ms.
Built C files in :
/tmp/ltsmin6651214103774252733
[2026-05-29 02:24:59] [INFO ] Computing symmetric may disable matrix : 130 transitions.
[2026-05-29 02:24:59] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 02:24:59] [INFO ] Computing symmetric may enable matrix : 130 transitions.
[2026-05-29 02:24:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 02:24:59] [INFO ] Computing Do-Not-Accords matrix : 130 transitions.
[2026-05-29 02:24:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 02:24:59] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6651214103774252733
Running compilation step : cd /tmp/ltsmin6651214103774252733;'/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 884 ms.
Running link step : cd /tmp/ltsmin6651214103774252733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin6651214103774252733;'/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/stateBased1566622794958761039.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA MAPKbis-PT-5310-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPKbis-PT-5310-LTLFireability-05 finished in 4595 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)||(X(X((!p1||X(p0)||G(!p0))))&&G(!p2))||G((!p1||X(p0))))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-29 02:25:01] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:25:01] [INFO ] Invariant cache hit.
[2026-05-29 02:25:01] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-29 02:25:01] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:25:01] [INFO ] Invariant cache hit.
[2026-05-29 02:25:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-29 02:25:01] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 84/84 places, 130/130 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)||G((X(!p0)||p1))||(X(X((X(!p0)||G(p0)||p2)))&&G(p3)))))'
Stuttering acceptance computed with spot in 1706 ms :[false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Running random walk in product with property : MAPKbis-PT-5310-LTLFireability-09
Product exploration explored 100000 steps with 1303 reset in 688 ms.
Product exploration explored 100000 steps with 1241 reset in 517 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 32 factoid took 1749 ms. Reduced automaton from 24 states, 192 edges and 4 AP (stutter sensitive) to 24 states, 192 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 20 to 15
RANDOM walk for 40000 steps (8 resets) in 562 ms. (71 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
[2026-05-29 02:25:06] [INFO ] Flow matrix only has 84 transitions (discarded 46 similar events)
[2026-05-29 02:25:06] [INFO ] Invariant cache hit.
[2026-05-29 02:25:06] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 48/80 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 32/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 16/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/80 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 19/99 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/99 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 53/152 variables, 36/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 36/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 18/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 3/155 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/155 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 9/164 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/164 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/164 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 1/165 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/165 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 3/168 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/168 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/168 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 252 constraints, problems are : Problem set: 0 solved, 7 unsolved in 577 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Problem apf10 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 2/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 9/31 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 3/34 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/80 variables, 32/66 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 32/98 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 16/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/80 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/99 variables, 20/135 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 53/152 variables, 36/175 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 36/211 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 18/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/152 variables, 0/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/155 variables, 3/232 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/155 variables, 0/232 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 9/164 variables, 6/238 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 6/244 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/164 variables, 3/247 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/164 variables, 0/247 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/165 variables, 1/248 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 0/248 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/168 variables, 2/250 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/168 variables, 2/252 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/168 variables, 1/253 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/168 variables, 0/253 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/168 variables, 0/253 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 253 constraints, problems are : Problem set: 6 solved, 1 unsolved in 306 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 84/84 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 130/130 transitions.
Graph (complete) has 261 edges and 84 vertex of which 68 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 68 transition count 105
Applied a total of 20 rules in 9 ms. Remains 68 /84 variables (removed 16) and now considering 105/130 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 68/84 places, 105/130 transitions.
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1048207 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 1
Probabilistic random walk after 1048207 steps, saw 576004 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
[2026-05-29 02:25:10] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8882708183023781854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1557718982599860163.kers'
[2026-05-29 02:25:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8882708183023781854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1557718982599860163.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 68 rows 34 cols 68 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-29 02:25:10] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1557718982599860163.kers
Total runtime 1 ms.
[2026-05-29 02:25:10] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/30 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/72 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/87 variables, 16/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/128 variables, 28/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/128 variables, 28/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 14/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/130 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/130 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/136 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/136 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/30 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/72 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 15/87 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 41/128 variables, 28/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 28/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 14/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/130 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/130 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/136 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/136 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 46 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 10 ms.
Found 8 invariant AP formulas.
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(p1&&p3&&p0&&p2)' '--given-formula=X(p3)' '--given-formula=X(!(!p1&&!p3&&p0))' '--given-formula=X(!(p1&&!p3&&!p0))' '--given-formula=X(!(p1&&p3&&!p0))' '--given-formula=X((p1&&p3&&p0))' '--given-formula=X(!(!p1&&!p3&&!p0))' '--given-formula=X(!(!p1&&p3&&!p0))' '--given-formula=X(!(!p1&&p3&&p0))' '--given-formula=X(p0)' '--given-formula=X(!(p1&&!p3&&p0))' '--given-formula=X(p1)' '--given-formula=X(X(p2))' '--given-formula=X(X(p3))' '--given-formula=X(X(!(!p1&&!p3&&p0)))' '--given-formula=X(X(!(p1&&p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p2&&!p0)))' '--given-formula=X(X((p1&&p3&&p0)))' '--given-formula=X(X(!(p1&&p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&!p3&&p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&p3&&!p2&&p0)))' '--given-formula=X(X(!(p1&&!p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&!p3&&!p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p2&&p0)))' '--given-formula=X(X(!(p1&&!p3&&!p2&&p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p2&&p0)))' '--given-formula=X(X(!(!p1&&p3&&p0)))' '--given-formula=X(X(p0))' '--given-formula=X(X(p1))' '--given-formula=G((p0||p1||p3))' '--given-formula=G((p0||!p1||p2||!p3))' '--given-formula=G((!p0||p1||p2||p3))' '--given-formula=G((!p0||p1||p3))' '--given-formula=G((p0||!p1||p2||p3))' '--given-formula=G((p0||p1||p2||p3))' '--given-formula=G((!p0||!p1||p2||p3))' '--given-formula=G((!p0||!p1||p2||!p3))' '-F' '/tmp/b4k11992725786580579189.hoa' '--given-strategy=auto-si' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(p1&&p3&&p0&&p2)' '--given-formula=X(p3)' '--given-formula=X(!(!p1&&!p3&&p0))' '--given-formula=X(!(p1&&!p3&&!p0))' '--given-formula=X(!(p1&&p3&&!p0))' '--given-formula=X((p1&&p3&&p0))' '--given-formula=X(!(!p1&&!p3&&!p0))' '--given-formula=X(!(!p1&&p3&&!p0))' '--given-formula=X(!(!p1&&p3&&p0))' '--given-formula=X(p0)' '--given-formula=X(!(p1&&!p3&&p0))' '--given-formula=X(p1)' '--given-formula=X(X(p2))' '--given-formula=X(X(p3))' '--given-formula=X(X(!(!p1&&!p3&&p0)))' '--given-formula=X(X(!(p1&&p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p2&&!p0)))' '--given-formula=X(X((p1&&p3&&p0)))' '--given-formula=X(X(!(p1&&p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&!p3&&p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&p3&&!p2&&p0)))' '--given-formula=X(X(!(p1&&!p3&&!p2&&!p0)))' '--given-formula=X(X(!(p1&&!p3&&!p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p2&&p0)))' '--given-formula=X(X(!(p1&&!p3&&!p2&&p0)))' '--given-formula=X(X(!(!p1&&!p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p0)))' '--given-formula=X(X(!(!p1&&p3&&!p2&&p0)))' '--given-formula=X(X(!(!p1&&p3&&p0)))' '--given-formula=X(X(p0))' '--given-formula=X(X(p1))' '--given-formula=G((p0||p1||p3))' '--given-formula=G((p0||!p1||p2||!p3))' '--given-formula=G((!p0||p1||p2||p3))' '--given-formula=G((!p0||p1||p3))' '--given-formula=G((p0||!p1||p2||p3))' '--given-formula=G((p0||p1||p2||p3))' '--given-formula=G((!p0||!p1||p2||p3))' '--given-formula=G((!p0||!p1||p2||!p3))' '-F' '/tmp/b4k17868413849355415686.hoa' '--given-strategy=auto-small' killed by timeout after 10 SECONDS
Knowledge-based reduction took 27193 ms.
Treatment of property MAPKbis-PT-5310-LTLFireability-09 finished in 30709 ms.
Application raised an uncaught exception Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
java.lang.NullPointerException: Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeReducer.integrateKnowledge(KnowledgeReducer.java:34)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:49)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Total runtime 84388 ms.

BK_STOP 1780021531729

--------------------
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="MAPKbis-PT-5310"
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 MAPKbis-PT-5310, 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 r162-smll-177961108000636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPKbis-PT-5310.tgz
mv MAPKbis-PT-5310 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;