MCC'2026- Execution of r034-tall-177946841700091

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V50P50N10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16206.720	3600000.00	5866916.00	302333.60	FTFFFT?FFTFTFTF?	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841700091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BridgeAndVehicles-COL-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841700091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.3K Mar 5 08:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 5 08:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 08:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 5 08:33 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.6K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 5 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Mar 5 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 5 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 42K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779501140006

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-23 01:52:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 01:52:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:52:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 01:52:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 01:52:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2026-05-23 01:52:21] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 01:52:21] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2026-05-23 01:52:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 800 ms. (49 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1205025030327283169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8161495181829190025.kers'
[2026-05-23 01:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1205025030327283169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8161495181829190025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 01:52:22] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8161495181829190025.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/22 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 2 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 197 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=65 )
Parikh walk visited 2 properties in 6 ms.
[2026-05-23 01:52:22] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2026-05-23 01:52:22] [INFO ] Flatten gal took : 17 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 01:52:22] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2026-05-23 01:52:23] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 162 ms.
[2026-05-23 01:52:23] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 36 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2026-05-23 01:52:23] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5485452661443691043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5971555497546461013.kers'
[2026-05-23 01:52:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5485452661443691043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5971555497546461013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-23 01:52:23] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5971555497546461013.kers
Total runtime 8 ms.
[2026-05-23 01:52:23] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 7 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/9 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 10 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42918ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 42950ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2026-05-23 01:53:06] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15484937120947087570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1577980734405729635.kers'
[2026-05-23 01:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15484937120947087570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1577980734405729635.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 128 cols 1286 entries
Finished phase 1 with 20 SingleSign rule and 101 generalized
[2026-05-23 01:53:06] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1577980734405729635.kers
Total runtime 5 ms.
[2026-05-23 01:53:06] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-23 01:53:06] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 01:53:06] [INFO ] Invariant cache hit.
[2026-05-23 01:53:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:53:07] [INFO ] Implicit Places using invariants and state equation in 879 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1223 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44287 ms. Remains : 127/128 places, 1228/1328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 01:53:07] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1965831579950727859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14034851809665312692.kers'
[2026-05-23 01:53:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1965831579950727859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14034851809665312692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 127 cols 1185 entries
Finished phase 1 with 71 SingleSign rule and 50 generalized
[2026-05-23 01:53:07] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14034851809665312692.kers
Total runtime 2 ms.
[2026-05-23 01:53:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41534ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41537ms
[2026-05-23 01:53:48] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 01:53:48] [INFO ] Invariant cache hit.
[2026-05-23 01:53:49] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-23 01:53:49] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 01:53:49] [INFO ] Invariant cache hit.
[2026-05-23 01:53:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:53:49] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42406 ms. Remains : 127/127 places, 1228/1228 transitions.
Support contains 14 out of 127 places after structural reductions.
[2026-05-23 01:53:49] [INFO ] Flatten gal took : 101 ms
[2026-05-23 01:53:50] [INFO ] Flatten gal took : 75 ms
[2026-05-23 01:53:50] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 2056 ms. (19 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40002 steps (32 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (36 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2026-05-23 01:53:50] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 01:53:50] [INFO ] Invariant cache hit.
[2026-05-23 01:53:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 153/159 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/361 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/363 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/375 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/375 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 153/159 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/361 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/363 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/375 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5431ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Graph (complete) has 1116 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 124 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 1227
Applied a total of 3 rules in 128 ms. Remains 124 /127 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 01:53:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9803105831903571852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11966797548941263006.kers'
[2026-05-23 01:53:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9803105831903571852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11966797548941263006.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 123 cols 1080 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 01:53:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11966797548941263006.kers
Total runtime 1 ms.
[2026-05-23 01:53:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/371 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1321 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42948ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 42951ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/127 places, 1225/1228 transitions.
Applied a total of 0 rules in 78 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43162 ms. Remains : 124/127 places, 1225/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (36 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 410897 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 410897 steps, saw 112373 distinct states, run finished after 3005 ms. (steps per millisecond=136 ) properties seen :0
[2026-05-23 01:54:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12772751175737701611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8649797188160532555.kers'
[2026-05-23 01:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12772751175737701611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8649797188160532555.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 123 cols 1073 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 01:54:42] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8649797188160532555.kers
Total runtime 2 ms.
[2026-05-23 01:54:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 151/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/355 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/369 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 151/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/355 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/369 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1993ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 267 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 49 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 124/124 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 01:54:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:54:45] [INFO ] Invariant cache hit.
[2026-05-23 01:54:45] [INFO ] Implicit Places using invariants in 271 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 376 ms. Remains : 123/124 places, 1225/1225 transitions.
RANDOM walk for 40001 steps (88 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (36 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 432904 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 432904 steps, saw 118258 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-23 01:54:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13294742328790575165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2578358074693535012.kers'
[2026-05-23 01:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13294742328790575165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2578358074693535012.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 973 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 01:54:48] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2578358074693535012.kers
Total runtime 1 ms.
[2026-05-23 01:54:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 151/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/356 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/368 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 151/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/356 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/368 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2369ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 47 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 44 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 01:54:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:54:51] [INFO ] Invariant cache hit.
[2026-05-23 01:54:51] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-23 01:54:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:54:51] [INFO ] Invariant cache hit.
[2026-05-23 01:54:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:54:52] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2026-05-23 01:54:52] [INFO ] Redundant transitions in 59 ms returned []
Running 1222 sub problems to find dead transitions.
[2026-05-23 01:54:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:54:52] [INFO ] Invariant cache hit.
[2026-05-23 01:54:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 31639ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 31642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32630 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 985 place count 121 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 986 place count 120 transition count 242
Applied a total of 986 rules in 21 ms. Remains 120 /123 variables (removed 3) and now considering 242/1225 (removed 983) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3251540993711852802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11184461462266574683.kers'
[2026-05-23 01:55:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3251540993711852802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11184461462266574683.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 119 cols 965 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 01:55:23] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11184461462266574683.kers
Total runtime 2 ms.
[2026-05-23 01:55:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 01:55:24] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 01:55:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 01:55:24] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 01:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 01:55:24] [INFO ] After 165ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 01:55:24] [INFO ] After 607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 01:55:24] [INFO ] After 978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1243 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 110 stabilizing places and 204 stable transitions
Graph (complete) has 2541 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X((G(p1)||X(F(p2)))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1228
Applied a total of 1 rules in 9 ms. Remains 126 /127 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 01:55:25] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3603200353781661987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8992986753718207280.kers'
[2026-05-23 01:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3603200353781661987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8992986753718207280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1184 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-23 01:55:25] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8992986753718207280.kers
Total runtime 2 ms.
[2026-05-23 01:55:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/373 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/374 variables, and 1270 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1170/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43198ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 43201ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 01:56:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7435675476107184040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17472168447802089556.kers'
[2026-05-23 01:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7435675476107184040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17472168447802089556.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1177 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 01:56:08] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17472168447802089556.kers
Total runtime 4 ms.
[2026-05-23 01:56:08] [INFO ] Implicit Places using invariants in 234 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1226/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43462 ms. Remains : 125/127 places, 1226/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X((G(p1)||X(F(p2)))))))'
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 finished in 43963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1 U (p2||G(p1))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1228
Applied a total of 1 rules in 12 ms. Remains 126 /127 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 01:56:09] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2034765999993331362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13647348171116156681.kers'
[2026-05-23 01:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2034765999993331362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13647348171116156681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1184 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-23 01:56:09] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13647348171116156681.kers
Total runtime 3 ms.
[2026-05-23 01:56:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/373 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/374 variables, and 1270 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21433 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1170/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43139ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 43142ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 01:56:52] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14324467729492607447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15300296588413103424.kers'
[2026-05-23 01:56:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14324467729492607447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15300296588413103424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1177 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 01:56:52] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15300296588413103424.kers
Total runtime 5 ms.
[2026-05-23 01:56:52] [INFO ] Implicit Places using invariants in 267 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1226/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43437 ms. Remains : 125/127 places, 1226/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1 U (p2||G(p1))))))'
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 515 ms.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Computed a total of 108 stabilizing places and 202 stable transitions
Graph (complete) has 2432 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 20 ms. Proved property starting from automaton with 10 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 44 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 finished in 44820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0||G(p1)))) U (F(!p1)&&X(p0))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 124 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 124 transition count 1227
Applied a total of 4 rules in 16 ms. Remains 124 /127 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 01:56:54] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16547039020047050424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17018907233648868059.kers'
[2026-05-23 01:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16547039020047050424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17018907233648868059.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 123 cols 1080 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 01:56:54] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17018907233648868059.kers
Total runtime 1 ms.
[2026-05-23 01:56:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/371 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1321 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21355 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42972ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 42975ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 01:57:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7184022575228801025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12016573409860168080.kers'
[2026-05-23 01:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7184022575228801025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12016573409860168080.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 123 cols 1073 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 01:57:37] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12016573409860168080.kers
Total runtime 2 ms.
[2026-05-23 01:57:37] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-23 01:57:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:57:37] [INFO ] Invariant cache hit.
[2026-05-23 01:57:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:57:37] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 1225/1228 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43768 ms. Remains : 124/127 places, 1225/1228 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||G(p1)))) U (F(!p1)&&X(p0))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), (NOT p0), p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
Product exploration explored 100000 steps with 772 reset in 528 ms.
Product exploration explored 100000 steps with 818 reset in 487 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
[2026-05-23 01:57:39] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:57:39] [INFO ] Invariant cache hit.
[2026-05-23 01:57:40] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2026-05-23 01:57:41] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2026-05-23 01:57:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 01:57:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-23 01:57:41] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-23 01:57:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:57:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 194 ms returned sat
[2026-05-23 01:57:42] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 49 ms.
[2026-05-23 01:57:42] [INFO ] Added : 11 causal constraints over 5 iterations in 427 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3386 ms.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 01:57:42] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:57:42] [INFO ] Invariant cache hit.
[2026-05-23 01:57:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1322 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21360 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42920ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42925ms
[2026-05-23 01:58:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:58:25] [INFO ] Invariant cache hit.
[2026-05-23 01:58:25] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 01:58:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:58:25] [INFO ] Invariant cache hit.
[2026-05-23 01:58:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:58:26] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 43704 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
[2026-05-23 01:58:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:58:27] [INFO ] Invariant cache hit.
[2026-05-23 01:58:27] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2026-05-23 01:58:28] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2026-05-23 01:58:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 01:58:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-23 01:58:29] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2026-05-23 01:58:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:58:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 193 ms returned sat
[2026-05-23 01:58:29] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 31 ms.
[2026-05-23 01:58:29] [INFO ] Added : 11 causal constraints over 5 iterations in 422 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3367 ms.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 857 reset in 434 ms.
Product exploration explored 100000 steps with 800 reset in 449 ms.
Spot run failed in 80 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14561124335018642654
[2026-05-23 01:58:31] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14561124335018642654
Running compilation step : cd /tmp/ltsmin14561124335018642654;'/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 2750 ms.
Running link step : cd /tmp/ltsmin14561124335018642654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14561124335018642654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7840473814603585895.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 01:58:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:58:46] [INFO ] Invariant cache hit.
[2026-05-23 01:58:46] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-23 01:58:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 01:58:46] [INFO ] Invariant cache hit.
[2026-05-23 01:58:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 01:58:47] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 758 ms. Remains : 124/124 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin3276094729910400948
[2026-05-23 01:58:47] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3276094729910400948
Running compilation step : cd /tmp/ltsmin3276094729910400948;'/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 2521 ms.
Running link step : cd /tmp/ltsmin3276094729910400948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3276094729910400948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased671762041777688530.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 01:59:02] [INFO ] Flatten gal took : 44 ms
[2026-05-23 01:59:02] [INFO ] Flatten gal took : 43 ms
[2026-05-23 01:59:02] [INFO ] Time to serialize gal into /tmp/LTL17659928306906549502.gal : 13 ms
[2026-05-23 01:59:02] [INFO ] Time to serialize properties into /tmp/LTL17966078078077757300.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17659928306906549502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18412055164765738873.hoa' '-atoms' '/tmp/LTL17966078078077757300.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((CONTROLEUR_0+CONTROLEUR_1)>=1)")||(G("(ATTENTE_B>1)")))))U((F("(ATTENTE_B<=1)"))&&(X("((CONTROLEUR_0+CONTROLEUR_1)>=1)")))...157
Formula 0 simplified : G(F!"(ATTENTE_B>1)" & FG!"((CONTROLEUR_0+CONTROLEUR_1)>=1)") R (G!"(ATTENTE_B<=1)" | X!"((CONTROLEUR_0+CONTROLEUR_1)>=1)")
Detected timeout of ITS tools.
[2026-05-23 01:59:32] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:59:32] [INFO ] Applying decomposition
[2026-05-23 01:59:32] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8265950614530773974.txt' '-o' '/tmp/graph8265950614530773974.bin' '-w' '/tmp/graph8265950614530773974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8265950614530773974.bin' '-l' '-1' '-v' '-w' '/tmp/graph8265950614530773974.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:59:32] [INFO ] Decomposing Gal with order
[2026-05-23 01:59:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:59:33] [INFO ] Removed a total of 3579 redundant transitions.
[2026-05-23 01:59:33] [INFO ] Flatten gal took : 415 ms
[2026-05-23 01:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 435 labels/synchronizations in 25 ms.
[2026-05-23 01:59:33] [INFO ] Time to serialize gal into /tmp/LTL17421841489368495404.gal : 2 ms
[2026-05-23 01:59:33] [INFO ] Time to serialize properties into /tmp/LTL17081363324784820185.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17421841489368495404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17081363324784820185.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((gu3.CONTROLEUR_0+gu3.CONTROLEUR_1)>=1)")||(G("(gi0.gu5.ATTENTE_B>1)")))))U((F("(gi0.gu5.ATTENTE_B<=1)"))&&(X("((gu3.CONTRO...189
Formula 0 simplified : G(F!"(gi0.gu5.ATTENTE_B>1)" & FG!"((gu3.CONTROLEUR_0+gu3.CONTROLEUR_1)>=1)") R (G!"(gi0.gu5.ATTENTE_B<=1)" | X!"((gu3.CONTROLEUR_0+g...177
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 finished in 174324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Graph (complete) has 2541 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 109 ms. Remains 126 /127 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 01:59:48] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18244833649203315500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11281270718332386867.kers'
[2026-05-23 01:59:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18244833649203315500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11281270718332386867.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1184 entries
Finished phase 1 with 70 SingleSign rule and 50 generalized
[2026-05-23 01:59:48] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11281270718332386867.kers
Total runtime 2 ms.
[2026-05-23 01:59:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41657ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41660ms
[2026-05-23 02:00:30] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:30] [INFO ] Invariant cache hit.
[2026-05-23 02:00:30] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 02:00:30] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:30] [INFO ] Invariant cache hit.
[2026-05-23 02:00:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:00:31] [INFO ] Implicit Places using invariants and state equation in 756 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 975 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 1228/1228 transitions.
Applied a total of 0 rules in 56 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42803 ms. Remains : 125/127 places, 1228/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 finished in 42980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||F(p1)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1228
Applied a total of 1 rules in 11 ms. Remains 126 /127 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 02:00:31] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:31] [INFO ] Invariant cache hit.
[2026-05-23 02:00:31] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 02:00:31] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:31] [INFO ] Invariant cache hit.
[2026-05-23 02:00:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:00:32] [INFO ] Implicit Places using invariants and state equation in 988 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1228/1228 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1229 ms. Remains : 125/127 places, 1228/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||F(p1)))'
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 422 ms.
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2436 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 16 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 2217 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((G(F((G(F(p0))||(!p1&&F(p0)))))||(p2&&F((G(F(p0))||(!p1&&F(p0))))))) U X(X((p3 U !p2))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1228
Applied a total of 1 rules in 6 ms. Remains 126 /127 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 02:00:33] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:33] [INFO ] Invariant cache hit.
[2026-05-23 02:00:33] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-23 02:00:33] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:33] [INFO ] Invariant cache hit.
[2026-05-23 02:00:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:00:34] [INFO ] Implicit Places using invariants and state equation in 793 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 1228/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1013 ms. Remains : 125/127 places, 1228/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F((G(F(p0))||(!p1&&F(p0)))))||(p2&&F((G(F(p0))||(!p1&&F(p0))))))) U X(X((p3 U !p2))))))'
Stuttering acceptance computed with spot in 575 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14
Product exploration explored 100000 steps with 1366 reset in 350 ms.
Product exploration explored 100000 steps with 1379 reset in 334 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2436 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 18 factoid took 245 ms. Reduced automaton from 12 states, 26 edges and 4 AP (stutter sensitive) to 12 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 445 ms. (89 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (40 resets) in 141 ms. (281 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (28 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
[2026-05-23 02:00:36] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-485089611628732573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-49626510000127919.kers'
[2026-05-23 02:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-485089611628732573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-49626510000127919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 125 cols 1083 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-23 02:00:36] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-49626510000127919.kers
Total runtime 1 ms.
[2026-05-23 02:00:36] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/156 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/371 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/373 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/156 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 215/371 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/373 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1228/1228 transitions.
Applied a total of 0 rules in 51 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 02:00:37] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:00:37] [INFO ] Invariant cache hit.
[2026-05-23 02:00:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/372 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 1269 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21258 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1120/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42930ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 42935ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/125 places, 1226/1228 transitions.
Applied a total of 0 rules in 47 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43036 ms. Remains : 125/125 places, 1226/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460732 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460732 steps, saw 125765 distinct states, run finished after 3010 ms. (steps per millisecond=153 ) properties seen :0
[2026-05-23 02:01:23] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-239498183159091139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3460801228956403752.kers'
[2026-05-23 02:01:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-239498183159091139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3460801228956403752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1077 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:01:23] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3460801228956403752.kers
Total runtime 2 ms.
[2026-05-23 02:01:23] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 51 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 125/125 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 53 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 02:01:23] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:01:23] [INFO ] Invariant cache hit.
[2026-05-23 02:01:23] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-23 02:01:23] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:01:23] [INFO ] Invariant cache hit.
[2026-05-23 02:01:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:01:24] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2026-05-23 02:01:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1223 sub problems to find dead transitions.
[2026-05-23 02:01:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:01:24] [INFO ] Invariant cache hit.
[2026-05-23 02:01:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SMT process timed out in 31752ms, After SMT, problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 31755ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32644 ms. Remains : 125/125 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 125 transition count 246
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 982 place count 125 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 984 place count 123 transition count 244
Applied a total of 984 rules in 9 ms. Remains 123 /125 variables (removed 2) and now considering 244/1226 (removed 982) 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-10293914021219999138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3845761023573990911.kers'
[2026-05-23 02:01:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10293914021219999138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3845761023573990911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 123 cols 1069 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 02:01:56] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3845761023573990911.kers
Total runtime 2 ms.
[2026-05-23 02:01:56] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 02:01:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-23 02:01:56] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 02:01:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:01:56] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 02:01:56] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 02:01:56] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 242 ms.
Knowledge based reduction with 18 factoid took 1822 ms. Reduced automaton from 12 states, 26 edges and 4 AP (stutter sensitive) to 12 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 565 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
[2026-05-23 02:01:58] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12513489440884422293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1124141460478550667.kers'
[2026-05-23 02:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12513489440884422293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1124141460478550667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 125 cols 1083 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-23 02:01:58] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1124141460478550667.kers
Total runtime 3 ms.
[2026-05-23 02:01:59] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-23 02:02:00] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2026-05-23 02:02:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 02:02:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 02:02:01] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2026-05-23 02:02:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:02:01] [INFO ] [Nat]Added 20 Read/Feed constraints in 251 ms returned sat
[2026-05-23 02:02:01] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 31 ms.
[2026-05-23 02:02:02] [INFO ] Added : 9 causal constraints over 2 iterations in 384 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 86012 ms.
Stuttering acceptance computed with spot in 421 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1228/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 02:02:02] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 02:02:02] [INFO ] Invariant cache hit.
[2026-05-23 02:02:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/372 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 1269 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21257 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1120/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42958ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 42960ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 02:02:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1243049327849118571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4015809290082042812.kers'
[2026-05-23 02:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1243049327849118571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4015809290082042812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1077 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:02:45] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4015809290082042812.kers
Total runtime 4 ms.
[2026-05-23 02:02:45] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 02:02:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:02:45] [INFO ] Invariant cache hit.
[2026-05-23 02:02:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:02:46] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/125 places, 1226/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43768 ms. Remains : 125/125 places, 1226/1228 transitions.
Computed a total of 108 stabilizing places and 202 stable transitions
Graph (complete) has 2432 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 18 factoid took 238 ms. Reduced automaton from 12 states, 26 edges and 4 AP (stutter sensitive) to 12 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 315 ms. (126 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 118 ms. (336 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (28 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2026-05-23 02:02:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:02:46] [INFO ] Invariant cache hit.
[2026-05-23 02:02:46] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 45 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 125/125 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (28 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 483258 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 483258 steps, saw 131728 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-23 02:02:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:02:50] [INFO ] Invariant cache hit.
[2026-05-23 02:02:50] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/370 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 46 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 125/125 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 45 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 02:02:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:02:50] [INFO ] Invariant cache hit.
[2026-05-23 02:02:50] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-23 02:02:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:02:50] [INFO ] Invariant cache hit.
[2026-05-23 02:02:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:02:51] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2026-05-23 02:02:51] [INFO ] Redundant transitions in 74 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 917 ms. Remains : 125/125 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 125 transition count 246
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 982 place count 125 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 984 place count 123 transition count 244
Applied a total of 984 rules in 8 ms. Remains 123 /125 variables (removed 2) and now considering 244/1226 (removed 982) 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-6315227776816538281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13066533744262813591.kers'
[2026-05-23 02:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6315227776816538281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13066533744262813591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 123 cols 1069 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 02:02:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13066533744262813591.kers
Total runtime 1 ms.
[2026-05-23 02:02:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 02:02:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-23 02:02:51] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 02:02:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:02:51] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 02:02:51] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 02:02:51] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
Knowledge based reduction with 18 factoid took 1836 ms. Reduced automaton from 12 states, 26 edges and 4 AP (stutter sensitive) to 12 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
[2026-05-23 02:02:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13453492767346777001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18000480620465394688.kers'
[2026-05-23 02:02:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13453492767346777001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18000480620465394688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1077 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:02:54] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18000480620465394688.kers
Total runtime 1 ms.
[2026-05-23 02:02:54] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2026-05-23 02:02:56] [INFO ] [Real]Absence check using state equation in 1528 ms returned sat
[2026-05-23 02:02:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 02:02:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 02:02:56] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2026-05-23 02:02:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:02:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 419 ms returned sat
[2026-05-23 02:02:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2026-05-23 02:02:57] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 26 ms.
[2026-05-23 02:02:58] [INFO ] Added : 46 causal constraints over 11 iterations in 602 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 12122 ms.
Stuttering acceptance computed with spot in 529 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 580 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1395 reset in 343 ms.
Product exploration explored 100000 steps with 1372 reset in 371 ms.
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9234367073827267843
[2026-05-23 02:03:00] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9234367073827267843
Running compilation step : cd /tmp/ltsmin9234367073827267843;'/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 2370 ms.
Running link step : cd /tmp/ltsmin9234367073827267843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9234367073827267843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4038583333746808288.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 02:03:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:03:15] [INFO ] Invariant cache hit.
[2026-05-23 02:03:15] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 02:03:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 02:03:15] [INFO ] Invariant cache hit.
[2026-05-23 02:03:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:03:16] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 784 ms. Remains : 125/125 places, 1226/1226 transitions.
Built C files in :
/tmp/ltsmin14507008323629485259
[2026-05-23 02:03:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14507008323629485259
Running compilation step : cd /tmp/ltsmin14507008323629485259;'/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 2675 ms.
Running link step : cd /tmp/ltsmin14507008323629485259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14507008323629485259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased427620560470198741.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 02:03:31] [INFO ] Flatten gal took : 82 ms
[2026-05-23 02:03:31] [INFO ] Flatten gal took : 74 ms
[2026-05-23 02:03:31] [INFO ] Time to serialize gal into /tmp/LTL4728181446069719426.gal : 9 ms
[2026-05-23 02:03:31] [INFO ] Time to serialize properties into /tmp/LTL7260035533382283045.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4728181446069719426.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9605270894105175452.hoa' '-atoms' '/tmp/LTL7260035533382283045.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7260035533382283045.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9605270894105175452.hoa
Detected timeout of ITS tools.
[2026-05-23 02:03:46] [INFO ] Flatten gal took : 26 ms
[2026-05-23 02:03:46] [INFO ] Flatten gal took : 27 ms
[2026-05-23 02:03:46] [INFO ] Time to serialize gal into /tmp/LTL9226378424293026051.gal : 6 ms
[2026-05-23 02:03:46] [INFO ] Time to serialize properties into /tmp/LTL6566483738184542125.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9226378424293026051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6566483738184542125.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F((G(F("(ROUTE_B>(VIDANGE_0+VIDANGE_1))")))||(("(SORTI_B<1)")&&(F("(ROUTE_B>(VIDANGE_0+VIDANGE_1))"))))))||(("(SORTI_B<2)")...333
Formula 0 simplified : F(G(FG!"(ROUTE_B>(VIDANGE_0+VIDANGE_1))" & (!"(SORTI_B<2)" | G(FG!"(ROUTE_B>(VIDANGE_0+VIDANGE_1))" & (!"(SORTI_B<1)" | G!"(ROUTE_B>...246
Detected timeout of ITS tools.
[2026-05-23 02:04:01] [INFO ] Flatten gal took : 22 ms
[2026-05-23 02:04:01] [INFO ] Applying decomposition
[2026-05-23 02:04:01] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph232282629324059579.txt' '-o' '/tmp/graph232282629324059579.bin' '-w' '/tmp/graph232282629324059579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph232282629324059579.bin' '-l' '-1' '-v' '-w' '/tmp/graph232282629324059579.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:04:01] [INFO ] Decomposing Gal with order
[2026-05-23 02:04:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:04:02] [INFO ] Removed a total of 1098 redundant transitions.
[2026-05-23 02:04:02] [INFO ] Flatten gal took : 855 ms
[2026-05-23 02:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1102 labels/synchronizations in 38 ms.
[2026-05-23 02:04:02] [INFO ] Time to serialize gal into /tmp/LTL16588328584538128399.gal : 6 ms
[2026-05-23 02:04:02] [INFO ] Time to serialize properties into /tmp/LTL16030884619451620677.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16588328584538128399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16030884619451620677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F((G(F("(gu1.ROUTE_B>(gu1.VIDANGE_0+gu1.VIDANGE_1))")))||(("(gu0.SORTI_B<1)")&&(F("(gu1.ROUTE_B>(gu1.VIDANGE_0+gu1.VIDANGE_...409
Formula 0 simplified : F(G(FG!"(gu1.ROUTE_B>(gu1.VIDANGE_0+gu1.VIDANGE_1))" & (!"(gu0.SORTI_B<2)" | G(FG!"(gu1.ROUTE_B>(gu1.VIDANGE_0+gu1.VIDANGE_1))" & (!...306
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 finished in 224222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 1228/1228 transitions.
Graph (complete) has 2541 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 1227
Applied a total of 3 rules in 78 ms. Remains 124 /127 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 02:04:17] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10583507716688759011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6776376865780323699.kers'
[2026-05-23 02:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10583507716688759011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6776376865780323699.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 123 cols 1030 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:04:17] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6776376865780323699.kers
Total runtime 1 ms.
[2026-05-23 02:04:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1223 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/371 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1371 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21383 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1223 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43389ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 43392ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 02:05:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15733540497596430604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1359392149416654476.kers'
[2026-05-23 02:05:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15733540497596430604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1359392149416654476.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 123 cols 1023 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 02:05:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1359392149416654476.kers
Total runtime 1 ms.
[2026-05-23 02:05:01] [INFO ] Implicit Places using invariants in 254 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/127 places, 1225/1228 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43813 ms. Remains : 123/127 places, 1225/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15
Product exploration explored 100000 steps with 268 reset in 516 ms.
Product exploration explored 100000 steps with 268 reset in 455 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 234 steps (0 resets) in 5 ms. (39 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Knowledge-based reduction took 200 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 60 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 02:05:03] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2020101011884859973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11128917462845751284.kers'
[2026-05-23 02:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2020101011884859973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11128917462845751284.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 02:05:03] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11128917462845751284.kers
Total runtime 3 ms.
[2026-05-23 02:05:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21368 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42988ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42991ms
[2026-05-23 02:05:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 02:05:46] [INFO ] Invariant cache hit.
[2026-05-23 02:05:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-23 02:05:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 02:05:46] [INFO ] Invariant cache hit.
[2026-05-23 02:05:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:05:46] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2026-05-23 02:05:46] [INFO ] Redundant transitions in 27 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43941 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 45 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 502 steps (0 resets) in 6 ms. (71 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 51 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 152 ms.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 268 reset in 419 ms.
Product exploration explored 100000 steps with 268 reset in 429 ms.
Built C files in :
/tmp/ltsmin13893420619063396212
[2026-05-23 02:05:47] [INFO ] Computing symmetric may disable matrix : 1225 transitions.
[2026-05-23 02:05:48] [INFO ] Computation of Complete disable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:48] [INFO ] Computing symmetric may enable matrix : 1225 transitions.
[2026-05-23 02:05:48] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:48] [INFO ] Computing Do-Not-Accords matrix : 1225 transitions.
[2026-05-23 02:05:48] [INFO ] Computation of Completed DNA matrix. took 77 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:48] [INFO ] Built C files in 604ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13893420619063396212
Running compilation step : cd /tmp/ltsmin13893420619063396212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13893420619063396212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13893420619063396212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 02:05:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 02:05:51] [INFO ] Invariant cache hit.
[2026-05-23 02:05:51] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-23 02:05:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 02:05:51] [INFO ] Invariant cache hit.
[2026-05-23 02:05:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 02:05:52] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2026-05-23 02:05:52] [INFO ] Redundant transitions in 21 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 123/123 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin17917226138974561966
[2026-05-23 02:05:52] [INFO ] Computing symmetric may disable matrix : 1225 transitions.
[2026-05-23 02:05:52] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:52] [INFO ] Computing symmetric may enable matrix : 1225 transitions.
[2026-05-23 02:05:52] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:52] [INFO ] Computing Do-Not-Accords matrix : 1225 transitions.
[2026-05-23 02:05:52] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:05:53] [INFO ] Built C files in 504ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17917226138974561966
Running compilation step : cd /tmp/ltsmin17917226138974561966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17917226138974561966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17917226138974561966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 21 ms
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:05:56] [INFO ] Time to serialize gal into /tmp/LTL11321448419738836837.gal : 7 ms
[2026-05-23 02:05:56] [INFO ] Time to serialize properties into /tmp/LTL4247130201561526438.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11321448419738836837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7674444482909806758.hoa' '-atoms' '/tmp/LTL4247130201561526438.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4247130201561526438.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7674444482909806758.hoa
Detected timeout of ITS tools.
[2026-05-23 02:06:11] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:06:11] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:06:11] [INFO ] Time to serialize gal into /tmp/LTL15680473677572264489.gal : 6 ms
[2026-05-23 02:06:11] [INFO ] Time to serialize properties into /tmp/LTL2847522523199073364.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15680473677572264489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2847522523199073364.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(SUR_PONT_B<2)"))))
Formula 0 simplified : GF!"(SUR_PONT_B<2)"
Detected timeout of ITS tools.
[2026-05-23 02:06:26] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:06:26] [INFO ] Applying decomposition
[2026-05-23 02:06:26] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16724449728624159800.txt' '-o' '/tmp/graph16724449728624159800.bin' '-w' '/tmp/graph16724449728624159800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16724449728624159800.bin' '-l' '-1' '-v' '-w' '/tmp/graph16724449728624159800.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:06:26] [INFO ] Decomposing Gal with order
[2026-05-23 02:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:06:26] [INFO ] Removed a total of 2891 redundant transitions.
[2026-05-23 02:06:26] [INFO ] Flatten gal took : 129 ms
[2026-05-23 02:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 455 labels/synchronizations in 15 ms.
[2026-05-23 02:06:26] [INFO ] Time to serialize gal into /tmp/LTL14755002921828764358.gal : 2 ms
[2026-05-23 02:06:26] [INFO ] Time to serialize properties into /tmp/LTL13770963348596602598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14755002921828764358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13770963348596602598.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u0.SUR_PONT_B<2)"))))
Formula 0 simplified : GF!"(i0.u0.SUR_PONT_B<2)"
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 finished in 143813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0||G(p1)))) U (F(!p1)&&X(p0))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F((G(F(p0))||(!p1&&F(p0)))))||(p2&&F((G(F(p0))||(!p1&&F(p0))))))) U X(X((p3 U !p2))))))'
Spot run failed in 42 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 02:06:41] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17369613002267956049
[2026-05-23 02:06:41] [INFO ] Applying decomposition
[2026-05-23 02:06:41] [INFO ] Computing symmetric may disable matrix : 1228 transitions.
[2026-05-23 02:06:42] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:06:42] [INFO ] Computation of Complete disable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18427031204948031712.txt' '-o' '/tmp/graph18427031204948031712.bin' '-w' '/tmp/graph18427031204948031712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18427031204948031712.bin' '-l' '-1' '-v' '-w' '/tmp/graph18427031204948031712.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:06:42] [INFO ] Decomposing Gal with order
[2026-05-23 02:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:06:42] [INFO ] Computing symmetric may enable matrix : 1228 transitions.
[2026-05-23 02:06:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:06:42] [INFO ] Computing Do-Not-Accords matrix : 1228 transitions.
[2026-05-23 02:06:42] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 02:06:42] [INFO ] Built C files in 561ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17369613002267956049
Running compilation step : cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 02:06:43] [INFO ] Removed a total of 2215 redundant transitions.
[2026-05-23 02:06:43] [INFO ] Flatten gal took : 1113 ms
[2026-05-23 02:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1171 labels/synchronizations in 42 ms.
[2026-05-23 02:06:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality16290628618632637689.gal : 4 ms
[2026-05-23 02:06:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality11248854825348395196.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16290628618632637689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11248854825348395196.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !(((G(F(("((gu0.CONTROLEUR_0+gu0.CONTROLEUR_1)>=1)")||(G("(gu1.ATTENTE_B>1)")))))U((F("(gu1.ATTENTE_B<=1)"))&&(X("((gu0.CONTROLEUR_0+g...181
Formula 0 simplified : G(F!"(gu1.ATTENTE_B>1)" & FG!"((gu0.CONTROLEUR_0+gu0.CONTROLEUR_1)>=1)") R (G!"(gu1.ATTENTE_B<=1)" | X!"((gu0.CONTROLEUR_0+gu0.CONTR...169
Compilation finished in 6121 ms.
Running link step : cd /tmp/ltsmin17369613002267956049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>(([](<>(([](<>((LTLAPp2==true)))||(!(LTLAPp3==true)&&<>((LTLAPp2==true))))))||((LTLAPp4==true)&&<>(([](<>((LTLAPp2==true)))||(!(LTLAPp3==true)&&<>((LTLAPp2==true)))))))) U X(X(((LTLAPp5==true) U !(LTLAPp4==true))))))' '--buchi-type=spotba'
LTSmin run took 32038 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin17369613002267956049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 02:31:29] [INFO ] Applying decomposition
[2026-05-23 02:31:29] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:31:29] [INFO ] Decomposing Gal with order
[2026-05-23 02:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:31:29] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to CAPACITE in partition [CONTROLEUR_0, CHOIX_0, VIDANGE_0],[CONTROLEUR_1, CHOIX_1, VIDANGE_1],[COMPTEUR_0],[COMPTEUR_1],[COMPTEUR_2],[COMPTEUR_3],[COMPTEUR_4],[COMPTEUR_5],[COMPTEUR_6],[COMPTEUR_7],[COMPTEUR_8],[COMPTEUR_9],[COMPTEUR_10],[NB_ATTENTE_A_0],[NB_ATTENTE_A_1],[NB_ATTENTE_A_2],[NB_ATTENTE_A_3],[NB_ATTENTE_A_4],[NB_ATTENTE_A_5],[NB_ATTENTE_A_6],[NB_ATTENTE_A_7],[NB_ATTENTE_A_8],[NB_ATTENTE_A_9],[NB_ATTENTE_A_10],[NB_ATTENTE_A_11],[NB_ATTENTE_A_12],[NB_ATTENTE_A_13],[NB_ATTENTE_A_14],[NB_ATTENTE_A_15],[NB_ATTENTE_A_16],[NB_ATTENTE_A_17],[NB_ATTENTE_A_18],[NB_ATTENTE_A_19],[NB_ATTENTE_A_20],[NB_ATTENTE_A_21],[NB_ATTENTE_A_22],[NB_ATTENTE_A_23],[NB_ATTENTE_A_24],[NB_ATTENTE_A_25],[NB_ATTENTE_A_26],[NB_ATTENTE_A_27],[NB_ATTENTE_A_28],[NB_ATTENTE_A_29],[NB_ATTENTE_A_30],[NB_ATTENTE_A_31],[NB_ATTENTE_A_32],[NB_ATTENTE_A_33],[NB_ATTENTE_A_34],[NB_ATTENTE_A_35],[NB_ATTENTE_A_36],[NB_ATTENTE_A_37],[NB_ATTENTE_A_38],[NB_ATTENTE_A_39],[NB_ATTENTE_A_40],[NB_ATTENTE_A_41],[NB_ATTENTE_A_42],[NB_ATTENTE_A_43],[NB_ATTENTE_A_44],[NB_ATTENTE_A_45],[NB_ATTENTE_A_46],[NB_ATTENTE_A_47],[NB_ATTENTE_A_48],[NB_ATTENTE_A_49],[NB_ATTENTE_A_50],[NB_ATTENTE_B_0],[NB_ATTENTE_B_1],[NB_ATTENTE_B_2],[NB_ATTENTE_B_3],[NB_ATTENTE_B_4],[NB_ATTENTE_B_5],[NB_ATTENTE_B_6],[NB_ATTENTE_B_7],[NB_ATTENTE_B_8],[NB_ATTENTE_B_9],[NB_ATTENTE_B_10],[NB_ATTENTE_B_11],[NB_ATTENTE_B_12],[NB_ATTENTE_B_13],[NB_ATTENTE_B_14],[NB_ATTENTE_B_15],[NB_ATTENTE_B_16],[NB_ATTENTE_B_17],[NB_ATTENTE_B_18],[NB_ATTENTE_B_19],[NB_ATTENTE_B_20],[NB_ATTENTE_B_21],[NB_ATTENTE_B_22],[NB_ATTENTE_B_23],[NB_ATTENTE_B_24],[NB_ATTENTE_B_25],[NB_ATTENTE_B_26],[NB_ATTENTE_B_27],[NB_ATTENTE_B_28],[NB_ATTENTE_B_29],[NB_ATTENTE_B_30],[NB_ATTENTE_B_31],[NB_ATTENTE_B_32],[NB_ATTENTE_B_33],[NB_ATTENTE_B_34],[NB_ATTENTE_B_35],[NB_ATTENTE_B_36],[NB_ATTENTE_B_37],[NB_ATTENTE_B_38],[NB_ATTENTE_B_39],[NB_ATTENTE_B_40],[NB_ATTENTE_B_41],[NB_ATTENTE_B_42],[NB_ATTENTE_B_43],[NB_ATTENTE_B_44],[NB_ATTENTE_B_45],[NB_ATTENTE_B_46],[NB_ATTENTE_B_47],[NB_ATTENTE_B_48],[NB_ATTENTE_B_49],[NB_ATTENTE_B_50],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 02:31:30] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:31:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality2178370859782686418.gal : 6 ms
[2026-05-23 02:31:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality10776841572831116029.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2178370859782686418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10776841572831116029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((G(F(("((CONTROLEUR_0+CONTROLEUR_1)>=1)")||(G("(ATTENTE_B>1)")))))U((F("(ATTENTE_B<=1)"))&&(X("((CONTROLEUR_0+CONTROLEUR_1)>=1)")))...157
Formula 0 simplified : G(F!"(ATTENTE_B>1)" & FG!"((CONTROLEUR_0+CONTROLEUR_1)>=1)") R (G!"(ATTENTE_B<=1)" | X!"((CONTROLEUR_0+CONTROLEUR_1)>=1)")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;