fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366100283
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
910.575 209121.00 285898.00 190.50 FFTFFFTFTTTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366100283.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-LTLCardinality-00
FORMULA_NAME ASLink-PT-01a-LTLCardinality-01
FORMULA_NAME ASLink-PT-01a-LTLCardinality-02
FORMULA_NAME ASLink-PT-01a-LTLCardinality-03
FORMULA_NAME ASLink-PT-01a-LTLCardinality-04
FORMULA_NAME ASLink-PT-01a-LTLCardinality-05
FORMULA_NAME ASLink-PT-01a-LTLCardinality-06
FORMULA_NAME ASLink-PT-01a-LTLCardinality-07
FORMULA_NAME ASLink-PT-01a-LTLCardinality-08
FORMULA_NAME ASLink-PT-01a-LTLCardinality-09
FORMULA_NAME ASLink-PT-01a-LTLCardinality-10
FORMULA_NAME ASLink-PT-01a-LTLCardinality-11
FORMULA_NAME ASLink-PT-01a-LTLCardinality-12
FORMULA_NAME ASLink-PT-01a-LTLCardinality-13
FORMULA_NAME ASLink-PT-01a-LTLCardinality-14
FORMULA_NAME ASLink-PT-01a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779470169815

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 17:16:11] [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-22 17:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:16:11] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2026-05-22 17:16:11] [INFO ] Transformed 431 places.
[2026-05-22 17:16:11] [INFO ] Transformed 735 transitions.
[2026-05-22 17:16:11] [INFO ] Found NUPN structural information;
[2026-05-22 17:16:11] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 728
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 420 transition count 710
Ensure Unique test removed 1 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 419 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 419 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 418 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 418 transition count 700
Applied a total of 21 rules in 118 ms. Remains 418 /431 variables (removed 13) and now considering 700/728 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14238684497527475974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4039770724187746270.kers'
[2026-05-22 17:16:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14238684497527475974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4039770724187746270.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 700 rows 418 cols 2665 entries
Finished phase 1 with 135 SingleSign rule and 210 generalized
[2026-05-22 17:16:12] [INFO ] Computed 73 invariants in 4 ms
Computed 73 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-4039770724187746270.kers
Total runtime 31 ms.
[2026-05-22 17:16:13] [INFO ] Implicit Places using invariants in 1236 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 203, 215, 220, 221, 222, 255, 257, 260, 278, 279, 280, 281, 299, 307, 315, 321, 327, 333, 347, 353, 359, 367]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1295 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 388/431 places, 700/728 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 379 transition count 691
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 379 transition count 691
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 374 transition count 686
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 374 transition count 686
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 372 transition count 684
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 372 transition count 684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 371 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 371 transition count 683
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 370 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 370 transition count 682
Applied a total of 36 rules in 51 ms. Remains 370 /388 variables (removed 18) and now considering 682/700 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2942188376469324273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6513749934841397446.kers'
[2026-05-22 17:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2942188376469324273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6513749934841397446.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 682 rows 370 cols 2433 entries
Finished phase 1 with 233 SingleSign rule and 94 generalized
[2026-05-22 17:16:13] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6513749934841397446.kers
Total runtime 4 ms.
[2026-05-22 17:16:13] [INFO ] Implicit Places using invariants in 460 ms returned []
[2026-05-22 17:16:13] [INFO ] Invariant cache hit.
[2026-05-22 17:16:14] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 370/431 places, 682/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3047 ms. Remains : 370/431 places, 682/728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Applied a total of 0 rules in 17 ms. Remains 370 /370 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-22 17:16:14] [INFO ] Invariant cache hit.
[2026-05-22 17:16:15] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-22 17:16:15] [INFO ] Invariant cache hit.
[2026-05-22 17:16:16] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-22 17:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/370 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/370 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1052 variables, and 53 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 0/681 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in LTL mode , in 1 iterations and 62033 ms. Remains : 370/370 places, 682/682 transitions.
Support contains 28 out of 370 places after structural reductions.
[2026-05-22 17:17:17] [INFO ] Flatten gal took : 81 ms
[2026-05-22 17:17:17] [INFO ] Flatten gal took : 40 ms
[2026-05-22 17:17:17] [INFO ] Input system was already deterministic with 682 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (730 resets) in 1648 ms. (24 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (254 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (275 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
[2026-05-22 17:17:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 164/188 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 182/370 variables, 33/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 682/1052 variables, 370/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1052 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 413 constraints, problems are : Problem set: 1 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/134 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Int declared 211/1052 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, Generalized P Invariants (flows): 5/33 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ASLink-PT-01a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA ASLink-PT-01a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(p1)))) U X(p0)))'
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 367 transition count 672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 367 transition count 672
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 365 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 365 transition count 663
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 363 transition count 654
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 363 transition count 654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 362 transition count 646
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 362 transition count 646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 361 transition count 638
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 361 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 360 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 360 transition count 630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 359 transition count 622
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 359 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 358 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 358 transition count 614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 357 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 357 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 356 transition count 598
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 356 transition count 598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 355 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 355 transition count 590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 354 transition count 582
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 354 transition count 582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 353 transition count 574
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 353 transition count 574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 352 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 352 transition count 566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 351 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 351 transition count 558
Applied a total of 38 rules in 84 ms. Remains 351 /370 variables (removed 19) and now considering 558/682 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11928073531344818517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3385891724380427912.kers'
[2026-05-22 17:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11928073531344818517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3385891724380427912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 558 rows 351 cols 1942 entries
Finished phase 1 with 228 SingleSign rule and 80 generalized
[2026-05-22 17:17:18] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3385891724380427912.kers
Total runtime 3 ms.
[2026-05-22 17:17:19] [INFO ] Implicit Places using invariants in 335 ms returned [287]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 350/370 places, 558/682 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 348 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 348 transition count 556
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 346 transition count 554
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 346 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 344 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 344 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 343 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 343 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 342 transition count 550
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 342 transition count 550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 341 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 341 transition count 549
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 340 transition count 548
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 340 transition count 548
Applied a total of 20 rules in 33 ms. Remains 340 /350 variables (removed 10) and now considering 548/558 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16860046320183059707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10200006461812434640.kers'
[2026-05-22 17:17:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16860046320183059707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10200006461812434640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 548 rows 340 cols 1914 entries
Finished phase 1 with 218 SingleSign rule and 80 generalized
[2026-05-22 17:17:19] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10200006461812434640.kers
Total runtime 7 ms.
[2026-05-22 17:17:19] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-22 17:17:19] [INFO ] Invariant cache hit.
[2026-05-22 17:17:20] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 340/370 places, 548/682 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1572 ms. Remains : 340/370 places, 548/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(p1)))) U X(p0)))'
Stuttering acceptance computed with spot in 650 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-00
Stuttering criterion allowed to conclude after 231 steps with 0 reset in 23 ms.
FORMULA ASLink-PT-01a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLCardinality-00 finished in 2348 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 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 369 transition count 615
Reduce places removed 67 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 302 transition count 614
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 301 transition count 612
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 299 transition count 612
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 139 place count 299 transition count 571
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 233 place count 246 transition count 571
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 17 rules applied. Total rules applied 250 place count 240 transition count 560
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 261 place count 229 transition count 560
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 261 place count 229 transition count 557
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 267 place count 226 transition count 557
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 274 place count 219 transition count 543
Iterating global reduction 6 with 7 rules applied. Total rules applied 281 place count 219 transition count 543
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 285 place count 219 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 286 place count 218 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 286 place count 218 transition count 538
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 288 place count 217 transition count 538
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 290 place count 215 transition count 529
Iterating global reduction 8 with 2 rules applied. Total rules applied 292 place count 215 transition count 529
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 293 place count 214 transition count 521
Iterating global reduction 8 with 1 rules applied. Total rules applied 294 place count 214 transition count 521
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 295 place count 213 transition count 513
Iterating global reduction 8 with 1 rules applied. Total rules applied 296 place count 213 transition count 513
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 297 place count 212 transition count 505
Iterating global reduction 8 with 1 rules applied. Total rules applied 298 place count 212 transition count 505
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 299 place count 211 transition count 497
Iterating global reduction 8 with 1 rules applied. Total rules applied 300 place count 211 transition count 497
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 301 place count 210 transition count 489
Iterating global reduction 8 with 1 rules applied. Total rules applied 302 place count 210 transition count 489
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 303 place count 209 transition count 481
Iterating global reduction 8 with 1 rules applied. Total rules applied 304 place count 209 transition count 481
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 305 place count 208 transition count 473
Iterating global reduction 8 with 1 rules applied. Total rules applied 306 place count 208 transition count 473
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 307 place count 207 transition count 465
Iterating global reduction 8 with 1 rules applied. Total rules applied 308 place count 207 transition count 465
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 309 place count 206 transition count 457
Iterating global reduction 8 with 1 rules applied. Total rules applied 310 place count 206 transition count 457
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 311 place count 205 transition count 449
Iterating global reduction 8 with 1 rules applied. Total rules applied 312 place count 205 transition count 449
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 313 place count 204 transition count 441
Iterating global reduction 8 with 1 rules applied. Total rules applied 314 place count 204 transition count 441
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 315 place count 203 transition count 433
Iterating global reduction 8 with 1 rules applied. Total rules applied 316 place count 203 transition count 433
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 317 place count 202 transition count 425
Iterating global reduction 8 with 1 rules applied. Total rules applied 318 place count 202 transition count 425
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 364 place count 179 transition count 402
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 366 place count 179 transition count 402
Applied a total of 366 rules in 215 ms. Remains 179 /370 variables (removed 191) and now considering 402/682 (removed 280) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9902085181470450592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11498956248834960792.kers'
[2026-05-22 17:17:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9902085181470450592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11498956248834960792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 179 cols 1597 entries
Finished phase 1 with 73 SingleSign rule and 82 generalized
[2026-05-22 17:17:21] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11498956248834960792.kers
Total runtime 2 ms.
[2026-05-22 17:17:21] [INFO ] Implicit Places using invariants in 168 ms returned [90, 98, 103, 106, 169, 176]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 170 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/370 places, 402/682 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 171 transition count 400
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 168 transition count 397
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 168 transition count 397
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 166 transition count 395
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 166 transition count 395
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 164 transition count 393
Applied a total of 18 rules in 29 ms. Remains 164 /173 variables (removed 9) and now considering 393/402 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3251216760467988231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12949744188482447120.kers'
[2026-05-22 17:17:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3251216760467988231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12949744188482447120.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 164 cols 1559 entries
Finished phase 1 with 71 SingleSign rule and 75 generalized
[2026-05-22 17:17:21] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12949744188482447120.kers
Total runtime 2 ms.
[2026-05-22 17:17:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 17:17:21] [INFO ] Invariant cache hit.
[2026-05-22 17:17:21] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/370 places, 393/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 845 ms. Remains : 164/370 places, 393/682 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 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-01
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLCardinality-01 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(!p1||X((X(G(p2)) U (!p1&&X(G(p2)))))))))'
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 365 transition count 670
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 365 transition count 670
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 362 transition count 660
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 362 transition count 660
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 360 transition count 651
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 359 transition count 643
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 359 transition count 643
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 358 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 358 transition count 635
Applied a total of 24 rules in 50 ms. Remains 358 /370 variables (removed 12) and now considering 635/682 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7698279865175636374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10629731069874682000.kers'
[2026-05-22 17:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7698279865175636374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10629731069874682000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 635 rows 358 cols 2255 entries
Finished phase 1 with 226 SingleSign rule and 89 generalized
[2026-05-22 17:17:22] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10629731069874682000.kers
Total runtime 3 ms.
[2026-05-22 17:17:22] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-22 17:17:22] [INFO ] Invariant cache hit.
[2026-05-22 17:17:23] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2026-05-22 17:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/993 variables, and 45 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 1/358 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/993 variables, and 55 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 0/634 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in LTL mode, iteration 1 : 358/370 places, 635/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61480 ms. Remains : 358/370 places, 635/682 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&&(X((X(G(p1)) U (!p2&&X(G(p1)))))||!p2))))'
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p1) p2), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 8327 steps with 177 reset in 46 ms.
FORMULA ASLink-PT-01a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLCardinality-03 finished in 61923 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 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 369 transition count 615
Reduce places removed 67 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 302 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 301 transition count 614
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 135 place count 301 transition count 573
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 229 place count 248 transition count 573
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 18 rules applied. Total rules applied 247 place count 241 transition count 562
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 258 place count 230 transition count 562
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 258 place count 230 transition count 558
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 266 place count 226 transition count 558
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 273 place count 219 transition count 544
Iterating global reduction 5 with 7 rules applied. Total rules applied 280 place count 219 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 285 place count 219 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 286 place count 218 transition count 539
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 288 place count 216 transition count 530
Iterating global reduction 7 with 2 rules applied. Total rules applied 290 place count 216 transition count 530
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 291 place count 215 transition count 522
Iterating global reduction 7 with 1 rules applied. Total rules applied 292 place count 215 transition count 522
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 293 place count 214 transition count 514
Iterating global reduction 7 with 1 rules applied. Total rules applied 294 place count 214 transition count 514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 295 place count 213 transition count 506
Iterating global reduction 7 with 1 rules applied. Total rules applied 296 place count 213 transition count 506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 297 place count 212 transition count 498
Iterating global reduction 7 with 1 rules applied. Total rules applied 298 place count 212 transition count 498
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 299 place count 211 transition count 490
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 211 transition count 490
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 301 place count 210 transition count 482
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 210 transition count 482
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 303 place count 209 transition count 474
Iterating global reduction 7 with 1 rules applied. Total rules applied 304 place count 209 transition count 474
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 305 place count 208 transition count 466
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 208 transition count 466
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 307 place count 207 transition count 458
Iterating global reduction 7 with 1 rules applied. Total rules applied 308 place count 207 transition count 458
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 309 place count 206 transition count 450
Iterating global reduction 7 with 1 rules applied. Total rules applied 310 place count 206 transition count 450
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 311 place count 205 transition count 442
Iterating global reduction 7 with 1 rules applied. Total rules applied 312 place count 205 transition count 442
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 313 place count 204 transition count 434
Iterating global reduction 7 with 1 rules applied. Total rules applied 314 place count 204 transition count 434
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 315 place count 203 transition count 426
Iterating global reduction 7 with 1 rules applied. Total rules applied 316 place count 203 transition count 426
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 366 place count 178 transition count 401
Applied a total of 366 rules in 108 ms. Remains 178 /370 variables (removed 192) and now considering 401/682 (removed 281) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15071459851069521370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-856057154355311024.kers'
[2026-05-22 17:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15071459851069521370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-856057154355311024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 178 cols 1588 entries
Finished phase 1 with 74 SingleSign rule and 81 generalized
[2026-05-22 17:18:24] [INFO ] Computed 23 invariants in 5 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-856057154355311024.kers
Total runtime 6 ms.
[2026-05-22 17:18:24] [INFO ] Implicit Places using invariants in 179 ms returned [71, 96, 101, 103, 167, 175]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 181 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/370 places, 401/682 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 170 transition count 399
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 167 transition count 396
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 167 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 165 transition count 394
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 165 transition count 394
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 162 transition count 391
Applied a total of 20 rules in 24 ms. Remains 162 /172 variables (removed 10) and now considering 391/401 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8122474951671665372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7799973631084451995.kers'
[2026-05-22 17:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8122474951671665372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7799973631084451995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 162 cols 1555 entries
Finished phase 1 with 72 SingleSign rule and 73 generalized
[2026-05-22 17:18:24] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7799973631084451995.kers
Total runtime 3 ms.
[2026-05-22 17:18:24] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-22 17:18:24] [INFO ] Invariant cache hit.
[2026-05-22 17:18:24] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/370 places, 391/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 766 ms. Remains : 162/370 places, 391/682 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 54 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-04
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLCardinality-04 finished in 851 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((X(X(F(p0))) U ((F(p2) U p3)||p1)))))'
Support contains 5 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 369 transition count 615
Reduce places removed 67 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 302 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 301 transition count 614
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 135 place count 301 transition count 575
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 223 place count 252 transition count 575
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 17 rules applied. Total rules applied 240 place count 246 transition count 564
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 251 place count 235 transition count 564
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 251 place count 235 transition count 562
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 255 place count 233 transition count 562
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 263 place count 225 transition count 547
Iterating global reduction 5 with 8 rules applied. Total rules applied 271 place count 225 transition count 547
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 276 place count 225 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 277 place count 224 transition count 542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 277 place count 224 transition count 541
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 279 place count 223 transition count 541
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 281 place count 221 transition count 532
Iterating global reduction 7 with 2 rules applied. Total rules applied 283 place count 221 transition count 532
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 284 place count 220 transition count 524
Iterating global reduction 7 with 1 rules applied. Total rules applied 285 place count 220 transition count 524
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 219 transition count 516
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 219 transition count 516
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 288 place count 218 transition count 508
Iterating global reduction 7 with 1 rules applied. Total rules applied 289 place count 218 transition count 508
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 341 place count 192 transition count 482
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 342 place count 191 transition count 481
Iterating global reduction 7 with 1 rules applied. Total rules applied 343 place count 191 transition count 481
Applied a total of 343 rules in 65 ms. Remains 191 /370 variables (removed 179) and now considering 481/682 (removed 201) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16633789597397710527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1781864547461148043.kers'
[2026-05-22 17:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16633789597397710527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1781864547461148043.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 191 cols 1915 entries
Finished phase 1 with 78 SingleSign rule and 87 generalized
[2026-05-22 17:18:24] [INFO ] Computed 26 invariants in 6 ms
Computed 26 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1781864547461148043.kers
Total runtime 8 ms.
[2026-05-22 17:18:25] [INFO ] Implicit Places using invariants in 249 ms returned [71, 83, 91, 100, 105, 107, 178, 185, 190]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 263 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/370 places, 481/682 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 180 transition count 479
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 177 transition count 476
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 177 transition count 476
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 175 transition count 474
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 175 transition count 474
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 171 transition count 470
Applied a total of 22 rules in 17 ms. Remains 171 /182 variables (removed 11) and now considering 470/481 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2609801675756117046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2824724750997750935.kers'
[2026-05-22 17:18:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2609801675756117046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2824724750997750935.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 470 rows 171 cols 1873 entries
Finished phase 1 with 68 SingleSign rule and 86 generalized
[2026-05-22 17:18:25] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2824724750997750935.kers
Total runtime 3 ms.
[2026-05-22 17:18:25] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-22 17:18:25] [INFO ] Invariant cache hit.
[2026-05-22 17:18:25] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/370 places, 470/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 991 ms. Remains : 171/370 places, 470/682 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((X(X(F(p0))) U ((F(p2) U p3)||p1)))))'
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p3)), false, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-06
Product exploration explored 100000 steps with 3092 reset in 248 ms.
Product exploration explored 100000 steps with 3135 reset in 236 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 19 factoid took 237 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (1238 resets) in 1163 ms. (34 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40001 steps (582 resets) in 354 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (518 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (578 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (593 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (531 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
[2026-05-22 17:18:27] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/95 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/128 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/170 variables, 9/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/171 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 470/641 variables, 171/188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/641 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 188 constraints, problems are : Problem set: 2 solved, 3 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/95 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 33/128 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Int declared 170/641 variables, and 17 constraints, problems are : Problem set: 5 solved, 0 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge based reduction with 24 factoid took 337 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p3), (NOT p3)]
Knowledge-based reduction took 1837 ms.
Stuttering acceptance computed with spot in 120 ms :[(NOT p3), (NOT p3)]
Support contains 2 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 470/470 transitions.
Applied a total of 0 rules in 15 ms. Remains 171 /171 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2026-05-22 17:18:28] [INFO ] Invariant cache hit.
[2026-05-22 17:18:28] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-22 17:18:28] [INFO ] Invariant cache hit.
[2026-05-22 17:18:29] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2026-05-22 17:18:29] [INFO ] Redundant transitions in 45 ms returned []
Running 460 sub problems to find dead transitions.
[2026-05-22 17:18:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 470/641 variables, 171/190 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 191 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 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 TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 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 TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 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 TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 6 (OVERLAPS) 470/641 variables, 171/191 constraints. Problems are: Problem set: 294 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 166/357 constraints. Problems are: Problem set: 294 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 357 constraints, problems are : Problem set: 294 solved, 166 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 166/460 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 294 solved, 166 unsolved
Search for dead transitions found 294 dead transitions in 60170ms
Found 294 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 294 transitions
Dead transitions reduction (with SMT) removed 294 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 171/171 places, 176/470 transitions.
Ensure Unique test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 150 transition count 159
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 133 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 132 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 132 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 131 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 130 transition count 156
Applied a total of 40 rules in 20 ms. Remains 130 /171 variables (removed 41) and now considering 156/176 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13708888804363292089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13994152968530005960.kers'
[2026-05-22 17:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13708888804363292089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13994152968530005960.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 130 cols 608 entries
Finished phase 1 with 45 SingleSign rule and 61 generalized
[2026-05-22 17:19:29] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13994152968530005960.kers
Total runtime 2 ms.
[2026-05-22 17:19:29] [INFO ] Implicit Places using invariants in 124 ms returned [6, 7, 8, 9, 10, 11, 12, 13, 14]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 138 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/171 places, 156/470 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 121 transition count 140
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 105 transition count 140
Applied a total of 32 rules in 3 ms. Remains 105 /121 variables (removed 16) and now considering 140/156 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10341719867912964408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-171230127827507042.kers'
[2026-05-22 17:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10341719867912964408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-171230127827507042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 105 cols 540 entries
Finished phase 1 with 46 SingleSign rule and 44 generalized
[2026-05-22 17:19:29] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-171230127827507042.kers
Total runtime 1 ms.
[2026-05-22 17:19:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 17:19:29] [INFO ] Invariant cache hit.
[2026-05-22 17:19:30] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 105/171 places, 140/470 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61259 ms. Remains : 105/171 places, 140/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 7318 steps (381 resets) in 70 ms. (103 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p3), (NOT p3)]
Knowledge-based reduction took 358 ms.
Stuttering acceptance computed with spot in 120 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 4985 reset in 137 ms.
Product exploration explored 100000 steps with 4904 reset in 179 ms.
Built C files in :
/tmp/ltsmin4021295729762073307
[2026-05-22 17:19:30] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2026-05-22 17:19:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:19:30] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2026-05-22 17:19:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:19:30] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2026-05-22 17:19:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:19:31] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4021295729762073307
Running compilation step : cd /tmp/ltsmin4021295729762073307;'/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 752 ms.
Running link step : cd /tmp/ltsmin4021295729762073307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin4021295729762073307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8276479765905257413.hoa' '--buchi-type=spotba'
LTSmin run took 5180 ms.
FORMULA ASLink-PT-01a-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01a-LTLCardinality-06 finished in 72215 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(F(p0))))))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 682/682 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 366 transition count 678
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 366 transition count 678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 364 transition count 676
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 364 transition count 676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 363 transition count 675
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 363 transition count 675
Applied a total of 14 rules in 75 ms. Remains 363 /370 variables (removed 7) and now considering 675/682 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15294505513092832750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16458140187188585681.kers'
[2026-05-22 17:19:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15294505513092832750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16458140187188585681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 675 rows 363 cols 2415 entries
Finished phase 1 with 226 SingleSign rule and 94 generalized
[2026-05-22 17:19:37] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16458140187188585681.kers
Total runtime 5 ms.
[2026-05-22 17:19:37] [INFO ] Implicit Places using invariants in 339 ms returned [301]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/370 places, 675/682 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 360 transition count 673
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 360 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 358 transition count 671
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 358 transition count 671
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 356 transition count 669
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 356 transition count 669
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 355 transition count 668
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 355 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 354 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 354 transition count 667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 353 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 353 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 352 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 352 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 351 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 351 transition count 664
Applied a total of 22 rules in 48 ms. Remains 351 /362 variables (removed 11) and now considering 664/675 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1639002703830353985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3376967330854699283.kers'
[2026-05-22 17:19:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1639002703830353985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3376967330854699283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 664 rows 351 cols 2384 entries
Finished phase 1 with 215 SingleSign rule and 94 generalized
[2026-05-22 17:19:37] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3376967330854699283.kers
Total runtime 5 ms.
[2026-05-22 17:19:37] [INFO ] Implicit Places using invariants in 386 ms returned []
[2026-05-22 17:19:37] [INFO ] Invariant cache hit.
[2026-05-22 17:19:38] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 351/370 places, 664/682 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1592 ms. Remains : 351/370 places, 664/682 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(F(p0))))))'
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLCardinality-13
Stuttering criterion allowed to conclude after 69 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLCardinality-13 finished in 1800 ms.
All properties solved by simple procedures.
Total runtime 207532 ms.

BK_STOP 1779470378936

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r002-oct2-177944366100283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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