fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074200532
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPUForwardProgress-PT-40b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
714.096 632957.00 789078.00 1147.70 FFFTFFFFTFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.5K Mar 7 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 7 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:40 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 199K 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 GPUForwardProgress-PT-40b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779734489121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 18:41:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:41:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:41:30] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 18:41:30] [INFO ] Transformed 796 places.
[2026-05-25 18:41:30] [INFO ] Transformed 837 transitions.
[2026-05-25 18:41:30] [INFO ] Found NUPN structural information;
[2026-05-25 18:41:30] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 78 place count 718 transition count 760
Iterating global reduction 1 with 77 rules applied. Total rules applied 155 place count 718 transition count 760
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 189 place count 684 transition count 726
Iterating global reduction 1 with 34 rules applied. Total rules applied 223 place count 684 transition count 726
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 254 place count 684 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 255 place count 683 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 683 transition count 694
Applied a total of 256 rules in 313 ms. Remains 683 /796 variables (removed 113) and now considering 694/837 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7574335110288087637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1483045528085015342.kers'
[2026-05-25 18:41:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7574335110288087637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1483045528085015342.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 683 cols 1789 entries
Finished phase 1 with 641 SingleSign rule and 1 generalized
[2026-05-25 18:41:31] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1483045528085015342.kers
Total runtime 4 ms.
[2026-05-25 18:41:31] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-25 18:41:31] [INFO ] Invariant cache hit.
[2026-05-25 18:41:31] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2026-05-25 18:41:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 694/1376 variables, 682/723 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1376/1377 variables, and 723 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 682/683 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 694/1376 variables, 682/723 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1376 variables, 693/1416 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1376/1377 variables, and 1416 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 682/683 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in LTL mode, iteration 1 : 683/796 places, 694/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61519 ms. Remains : 683/796 places, 694/837 transitions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Applied a total of 0 rules in 23 ms. Remains 683 /683 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2026-05-25 18:42:32] [INFO ] Invariant cache hit.
[2026-05-25 18:42:32] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 18:42:32] [INFO ] Invariant cache hit.
[2026-05-25 18:42:32] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 683/683 places, 694/694 transitions.
Support contains 40 out of 683 places after structural reductions.
[2026-05-25 18:42:33] [INFO ] Flatten gal took : 72 ms
[2026-05-25 18:42:33] [INFO ] Flatten gal took : 34 ms
[2026-05-25 18:42:33] [INFO ] Input system was already deterministic with 694 transitions.
RANDOM walk for 40000 steps (119 resets) in 1935 ms. (20 steps per ms) remains 18/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
[2026-05-25 18:42:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 325/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 335/682 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 694/1376 variables, 682/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/1377 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/1377 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1377/1377 variables, and 724 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1567 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 683/683 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 325/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 335/682 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 694/1376 variables, 682/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1376 variables, 18/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1376 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/1377 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1377 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/1377 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1377/1377 variables, and 742 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4517 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 683/683 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6106ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 10 different solutions.
Finished Parikh walk after 389 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=194 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 1703 ms.
Computed a total of 126 stabilizing places and 126 stable transitions
Graph (complete) has 1063 edges and 683 vertex of which 639 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.23 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((p0&&X((X((p1&&X(p2)))&&(p0 U p3)))))))'
Support contains 6 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 682
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 667 transition count 676
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 667 transition count 676
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 667 transition count 670
Applied a total of 40 rules in 55 ms. Remains 667 /683 variables (removed 16) and now considering 670/694 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9221846984123108442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13676187062404840887.kers'
[2026-05-25 18:42:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9221846984123108442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13676187062404840887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 670 rows 667 cols 1741 entries
Finished phase 1 with 625 SingleSign rule and 1 generalized
[2026-05-25 18:42:42] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13676187062404840887.kers
Total runtime 5 ms.
[2026-05-25 18:42:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-25 18:42:42] [INFO ] Invariant cache hit.
[2026-05-25 18:42:42] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 669 sub problems to find dead transitions.
[2026-05-25 18:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (OVERLAPS) 670/1336 variables, 666/707 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1337 variables, and 707 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/667 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (OVERLAPS) 670/1336 variables, 666/707 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1336 variables, 669/1376 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1337 variables, and 1376 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/667 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 667/683 places, 670/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 667/683 places, 670/694 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((p0&&X((X((p1&&X(p2)))&&(p0 U p3)))))))'
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), true, (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-00 finished in 61328 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(((p1 U p2)&&p0))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Graph (trivial) has 563 edges and 683 vertex of which 6 / 683 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1057 edges and 678 vertex of which 634 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 337 place count 633 transition count 349
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 345 rules applied. Total rules applied 682 place count 298 transition count 339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 684 place count 296 transition count 339
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 684 place count 296 transition count 258
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 846 place count 215 transition count 258
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 885 place count 176 transition count 219
Iterating global reduction 3 with 39 rules applied. Total rules applied 924 place count 176 transition count 219
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1166 place count 55 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1167 place count 55 transition count 97
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1204 place count 18 transition count 24
Iterating global reduction 4 with 37 rules applied. Total rules applied 1241 place count 18 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1245 place count 16 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1246 place count 16 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1247 place count 15 transition count 22
Applied a total of 1247 rules in 73 ms. Remains 15 /683 variables (removed 668) and now considering 22/694 (removed 672) transitions.
[2026-05-25 18:43:43] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6243470961573182792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4879714540899930790.kers'
[2026-05-25 18:43:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6243470961573182792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4879714540899930790.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 15 cols 74 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 18:43:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4879714540899930790.kers
Total runtime 0 ms.
[2026-05-25 18:43:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 18:43:43] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2026-05-25 18:43:43] [INFO ] Invariant cache hit.
[2026-05-25 18:43:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:43:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-25 18:43:43] [INFO ] Redundant transitions in 12 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-25 18:43:43] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2026-05-25 18:43:43] [INFO ] Invariant cache hit.
[2026-05-25 18:43:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 3/35 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 16 constraints, problems are : Problem set: 0 solved, 19 unsolved in 224 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 3/35 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 35 constraints, problems are : Problem set: 0 solved, 19 unsolved in 271 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/683 places, 22/694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 15/683 places, 22/694 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(((p1 U p2)&&p0))))'
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-01 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Graph (trivial) has 570 edges and 683 vertex of which 6 / 683 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1057 edges and 678 vertex of which 634 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 340 place count 633 transition count 346
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 349 rules applied. Total rules applied 689 place count 295 transition count 335
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 692 place count 293 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 693 place count 292 transition count 334
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 693 place count 292 transition count 251
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 859 place count 209 transition count 251
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 898 place count 170 transition count 212
Iterating global reduction 4 with 39 rules applied. Total rules applied 937 place count 170 transition count 212
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1181 place count 48 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1182 place count 48 transition count 89
Discarding 39 places :
Symmetric choice reduction at 5 with 39 rule applications. Total rules 1221 place count 9 transition count 12
Iterating global reduction 5 with 39 rules applied. Total rules applied 1260 place count 9 transition count 12
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 5 with 2 rules applied. Total rules applied 1262 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1263 place count 7 transition count 10
Applied a total of 1263 rules in 48 ms. Remains 7 /683 variables (removed 676) and now considering 10/694 (removed 684) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12169770331357107222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6508804889606934701.kers'
[2026-05-25 18:43:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12169770331357107222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6508804889606934701.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 20 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 18:43:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6508804889606934701.kers
Total runtime 0 ms.
[2026-05-25 18:43:44] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 18:43:44] [INFO ] Invariant cache hit.
[2026-05-25 18:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:43:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-25 18:43:44] [INFO ] Redundant transitions in 10 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 18:43:44] [INFO ] Invariant cache hit.
[2026-05-25 18:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 94 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/683 places, 10/694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 7/683 places, 10/694 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-02 finished in 349 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((G(p0)||p1))) U !X((p0 U p2))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 682
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 671 transition count 680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 664 transition count 673
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 664 transition count 673
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 47 place count 664 transition count 666
Applied a total of 47 rules in 106 ms. Remains 664 /683 variables (removed 19) and now considering 666/694 (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-15540535496834437257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16938328092134047896.kers'
[2026-05-25 18:43:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15540535496834437257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16938328092134047896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 666 rows 664 cols 1733 entries
Finished phase 1 with 622 SingleSign rule and 1 generalized
[2026-05-25 18:43:44] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16938328092134047896.kers
Total runtime 3 ms.
[2026-05-25 18:43:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 18:43:45] [INFO ] Invariant cache hit.
[2026-05-25 18:43:45] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2026-05-25 18:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1330 variables, and 704 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 665/1369 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1330 variables, and 1369 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 664/683 places, 666/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60802 ms. Remains : 664/683 places, 666/694 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((G(p0)||p1))) U !X((p0 U p2))))'
Stuttering acceptance computed with spot in 106 ms :[p2, p2, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.8 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 14 ms. Proved property starting from automaton with 3 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-03 finished in 61489 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(((G(p0) U p1) U ((p2 U X(X(p3)))&&X(p0)))))'
Support contains 4 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 681
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 666 transition count 675
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 666 transition count 675
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 666 transition count 669
Applied a total of 42 rules in 75 ms. Remains 666 /683 variables (removed 17) and now considering 669/694 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15543580408055804913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10926983717968496264.kers'
[2026-05-25 18:44:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15543580408055804913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10926983717968496264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 669 rows 666 cols 1739 entries
Finished phase 1 with 624 SingleSign rule and 1 generalized
[2026-05-25 18:44:46] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10926983717968496264.kers
Total runtime 3 ms.
[2026-05-25 18:44:46] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-25 18:44:46] [INFO ] Invariant cache hit.
[2026-05-25 18:44:47] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2026-05-25 18:44:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1334/1335 variables, and 706 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/666 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 668/1374 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1334/1335 variables, and 1374 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/666 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 666/683 places, 669/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60905 ms. Remains : 666/683 places, 669/694 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(((G(p0) U p1) U ((p2 U X(X(p3)))&&X(p0)))))'
Stuttering acceptance computed with spot in 1013 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p0), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) p0 (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-04 finished in 62051 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 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Graph (trivial) has 567 edges and 683 vertex of which 6 / 683 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1057 edges and 678 vertex of which 634 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.6 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 633 transition count 350
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 345 rules applied. Total rules applied 681 place count 299 transition count 339
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 684 place count 297 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 296 transition count 338
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 685 place count 296 transition count 254
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 853 place count 212 transition count 254
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 892 place count 173 transition count 215
Iterating global reduction 4 with 39 rules applied. Total rules applied 931 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1175 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1176 place count 51 transition count 92
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1214 place count 13 transition count 17
Iterating global reduction 5 with 38 rules applied. Total rules applied 1252 place count 13 transition count 17
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 5 with 2 rules applied. Total rules applied 1254 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1255 place count 11 transition count 15
Applied a total of 1255 rules in 36 ms. Remains 11 /683 variables (removed 672) and now considering 15/694 (removed 679) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4307722855597821735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11044990387964386448.kers'
[2026-05-25 18:45:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4307722855597821735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11044990387964386448.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 11 cols 36 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 18:45:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11044990387964386448.kers
Total runtime 0 ms.
[2026-05-25 18:45:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 18:45:48] [INFO ] Invariant cache hit.
[2026-05-25 18:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:45:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-25 18:45:48] [INFO ] Redundant transitions in 11 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-25 18:45:48] [INFO ] Invariant cache hit.
[2026-05-25 18:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 102 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 123 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/683 places, 15/694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 11/683 places, 15/694 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 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-05 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 673 transition count 683
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 667 transition count 677
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 667 transition count 677
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 667 transition count 671
Applied a total of 39 rules in 48 ms. Remains 667 /683 variables (removed 16) and now considering 671/694 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14680405934542940267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16374264732114771506.kers'
[2026-05-25 18:45:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14680405934542940267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16374264732114771506.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 671 rows 667 cols 1743 entries
Finished phase 1 with 625 SingleSign rule and 1 generalized
[2026-05-25 18:45:48] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16374264732114771506.kers
Total runtime 9 ms.
[2026-05-25 18:45:48] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 18:45:48] [INFO ] Invariant cache hit.
[2026-05-25 18:45:49] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2026-05-25 18:45:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (OVERLAPS) 671/1337 variables, 666/707 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1337/1338 variables, and 707 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/667 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (OVERLAPS) 671/1337 variables, 666/707 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1337 variables, 670/1377 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1338 variables, and 1377 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 666/667 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 667/683 places, 671/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60839 ms. Remains : 667/683 places, 671/694 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-06 finished in 60988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(p0)||(p0&&F(p1))))) U (p0&&G(p2))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Graph (trivial) has 565 edges and 683 vertex of which 6 / 683 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1057 edges and 678 vertex of which 634 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 334 place count 633 transition count 352
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 341 rules applied. Total rules applied 675 place count 301 transition count 343
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 678 place count 299 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 679 place count 298 transition count 342
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 679 place count 298 transition count 260
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 843 place count 216 transition count 260
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 882 place count 177 transition count 221
Iterating global reduction 4 with 39 rules applied. Total rules applied 921 place count 177 transition count 221
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1165 place count 55 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1166 place count 55 transition count 98
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1203 place count 18 transition count 25
Iterating global reduction 5 with 37 rules applied. Total rules applied 1240 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1246 place count 15 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1247 place count 14 transition count 23
Applied a total of 1247 rules in 35 ms. Remains 14 /683 variables (removed 669) and now considering 23/694 (removed 671) transitions.
[2026-05-25 18:46:49] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15864319719703467603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6573489624541098642.kers'
[2026-05-25 18:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15864319719703467603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6573489624541098642.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 14 cols 52 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 18:46:49] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6573489624541098642.kers
Total runtime 0 ms.
[2026-05-25 18:46:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 18:46:49] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2026-05-25 18:46:49] [INFO ] Invariant cache hit.
[2026-05-25 18:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:46:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-25 18:46:49] [INFO ] Redundant transitions in 10 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-25 18:46:49] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2026-05-25 18:46:49] [INFO ] Invariant cache hit.
[2026-05-25 18:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 150 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 171 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/683 places, 23/694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 14/683 places, 23/694 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(p0)||(p0&&F(p1))))) U (p0&&G(p2))))'
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), false, (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-07 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p0||X((G(p1) U (p0&&G(p1))))) U X(p2)) U (G(((p0||X((G(p1) U (p0&&G(p1))))) U X(p2)))||(((p0||X((G(p1) U (p0&&G(p1))))) U X(p2))&&X(!p1))))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 682
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 671 transition count 680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 664 transition count 673
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 664 transition count 673
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 47 place count 664 transition count 666
Applied a total of 47 rules in 51 ms. Remains 664 /683 variables (removed 19) and now considering 666/694 (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-16276726350193019646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1490832138817784564.kers'
[2026-05-25 18:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16276726350193019646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1490832138817784564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 666 rows 664 cols 1733 entries
Finished phase 1 with 622 SingleSign rule and 1 generalized
[2026-05-25 18:46:50] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1490832138817784564.kers
Total runtime 4 ms.
[2026-05-25 18:46:50] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 18:46:50] [INFO ] Invariant cache hit.
[2026-05-25 18:46:51] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2026-05-25 18:46:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1330 variables, and 704 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 665/1369 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1330 variables, and 1369 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 664/683 places, 666/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 664/683 places, 666/694 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((G(p1) U (p0&&G(p1))))) U X(p2)) U (G(((p0||X((G(p1) U (p0&&G(p1))))) U X(p2)))||(((p0||X((G(p1) U (p0&&G(p1))))) U X(p2))&&X(!p1))))))'
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), false, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), false, false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 23 factoid took 18 ms. Proved property starting from automaton with 8 states, 31 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-08 finished in 61705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(p1 U (G(p1)||(p1&&G(p2))))) U X(p3)))'
Support contains 7 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 672 transition count 682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 665 transition count 675
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 665 transition count 675
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 665 transition count 668
Applied a total of 44 rules in 51 ms. Remains 665 /683 variables (removed 18) and now considering 668/694 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10201305733583701018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11054901363610463586.kers'
[2026-05-25 18:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10201305733583701018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11054901363610463586.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 668 rows 665 cols 1737 entries
Finished phase 1 with 623 SingleSign rule and 1 generalized
[2026-05-25 18:47:52] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11054901363610463586.kers
Total runtime 8 ms.
[2026-05-25 18:47:52] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 18:47:52] [INFO ] Invariant cache hit.
[2026-05-25 18:47:52] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 667 sub problems to find dead transitions.
[2026-05-25 18:47:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1332/1333 variables, and 705 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/665 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1332 variables, 667/1372 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1332/1333 variables, and 1372 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/665 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 665/683 places, 668/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60762 ms. Remains : 665/683 places, 668/694 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(p1 U (G(p1)||(p1&&G(p2))))) U X(p3)))'
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 68146 steps with 202 reset in 173 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-09 finished in 61298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(G(p1)) U G(p2))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 681
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 665 transition count 674
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 665 transition count 674
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 45 place count 665 transition count 667
Applied a total of 45 rules in 43 ms. Remains 665 /683 variables (removed 18) and now considering 667/694 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8764190884255039779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14249325061084659081.kers'
[2026-05-25 18:48:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8764190884255039779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14249325061084659081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 667 rows 665 cols 1735 entries
Finished phase 1 with 623 SingleSign rule and 1 generalized
[2026-05-25 18:48:53] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14249325061084659081.kers
Total runtime 3 ms.
[2026-05-25 18:48:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 18:48:53] [INFO ] Invariant cache hit.
[2026-05-25 18:48:54] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2026-05-25 18:48:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 667/1331 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1332 variables, and 705 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/665 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 667/1331 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1331 variables, 666/1371 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1332 variables, and 1371 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/665 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 665/683 places, 667/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60801 ms. Remains : 665/683 places, 667/694 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(G(p1)) U G(p2))))'
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-11 finished in 61086 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(F((p0||(p1 U (G(p1)||(p1&&G(!p0))))))))))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 682
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 671 transition count 680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 664 transition count 673
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 664 transition count 673
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 47 place count 664 transition count 666
Applied a total of 47 rules in 45 ms. Remains 664 /683 variables (removed 19) and now considering 666/694 (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-5879522236607266291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15396027137650358442.kers'
[2026-05-25 18:49:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5879522236607266291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15396027137650358442.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 666 rows 664 cols 1733 entries
Finished phase 1 with 622 SingleSign rule and 1 generalized
[2026-05-25 18:49:54] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15396027137650358442.kers
Total runtime 3 ms.
[2026-05-25 18:49:54] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 18:49:54] [INFO ] Invariant cache hit.
[2026-05-25 18:49:55] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2026-05-25 18:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1330 variables, and 704 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 665/1369 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1330 variables, and 1369 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 663/664 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 664/683 places, 666/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60816 ms. Remains : 664/683 places, 666/694 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(F((p0||(p1 U (G(p1)||(p1&&G(!p0))))))))))'
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (116 resets) in 382 ms. (104 steps per ms) remains 2/3 properties
BEST_FIRST walk for 39583 steps (11 resets) in 134 ms. (293 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 469 ms.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 666/666 transitions.
Applied a total of 0 rules in 19 ms. Remains 664 /664 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2026-05-25 18:50:56] [INFO ] Invariant cache hit.
[2026-05-25 18:50:56] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-25 18:50:56] [INFO ] Invariant cache hit.
[2026-05-25 18:50:57] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 664/664 places, 666/666 transitions.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1035 edges and 664 vertex of which 620 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (118 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 85 ms. (465 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2026-05-25 18:50:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 618/663 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1330 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1330 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/664 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 618/663 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1330 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1330 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1330 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 664/664 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 139 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1232 ms.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Spot run failed in 73 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14350173771609733425
[2026-05-25 18:50:59] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14350173771609733425
Running compilation step : cd /tmp/ltsmin14350173771609733425;'/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 1170 ms.
Running link step : cd /tmp/ltsmin14350173771609733425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14350173771609733425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6730119410155593731.hoa' '--buchi-type=spotba'
LTSmin run took 87 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-13 finished in 65982 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(X(G((p0&&X(p1)))))))))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 681
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 666 transition count 675
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 666 transition count 675
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 666 transition count 669
Applied a total of 42 rules in 46 ms. Remains 666 /683 variables (removed 17) and now considering 669/694 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8311298379827382231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15607357941757910215.kers'
[2026-05-25 18:51:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8311298379827382231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15607357941757910215.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 669 rows 666 cols 1739 entries
Finished phase 1 with 624 SingleSign rule and 1 generalized
[2026-05-25 18:51:00] [INFO ] Computed 41 invariants in 4 ms
Computed 41 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15607357941757910215.kers
Total runtime 6 ms.
[2026-05-25 18:51:00] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-25 18:51:00] [INFO ] Invariant cache hit.
[2026-05-25 18:51:01] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2026-05-25 18:51:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1334/1335 variables, and 706 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/666 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 669/1334 variables, 665/706 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 668/1374 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1334/1335 variables, and 1374 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 665/666 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 666/683 places, 669/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60863 ms. Remains : 666/683 places, 669/694 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(X(G((p0&&X(p1)))))))))'
Stuttering acceptance computed with spot in 285 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-14 finished in 61185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 694/694 transitions.
Graph (trivial) has 567 edges and 683 vertex of which 6 / 683 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1057 edges and 678 vertex of which 634 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 340 place count 633 transition count 346
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 349 rules applied. Total rules applied 689 place count 295 transition count 335
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 691 place count 293 transition count 335
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 691 place count 293 transition count 253
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 855 place count 211 transition count 253
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 893 place count 173 transition count 215
Iterating global reduction 3 with 38 rules applied. Total rules applied 931 place count 173 transition count 215
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1173 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1174 place count 52 transition count 93
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1213 place count 13 transition count 16
Iterating global reduction 4 with 39 rules applied. Total rules applied 1252 place count 13 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1256 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1257 place count 10 transition count 14
Applied a total of 1257 rules in 23 ms. Remains 10 /683 variables (removed 673) and now considering 14/694 (removed 680) transitions.
[2026-05-25 18:52:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15249001321359754801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11072478507737482354.kers'
[2026-05-25 18:52:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15249001321359754801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11072478507737482354.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 10 cols 43 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 18:52:01] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11072478507737482354.kers
Total runtime 0 ms.
[2026-05-25 18:52:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 18:52:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-25 18:52:01] [INFO ] Invariant cache hit.
[2026-05-25 18:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:52:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 18:52:01] [INFO ] Redundant transitions in 12 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-25 18:52:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-25 18:52:01] [INFO ] Invariant cache hit.
[2026-05-25 18:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 116 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 145 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/683 places, 14/694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 10/683 places, 14/694 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-15 finished in 415 ms.
All properties solved by simple procedures.
Total runtime 631773 ms.

BK_STOP 1779735122078

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-40b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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