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 |
| 667.596 | 458967.00 | 571430.00 | 932.50 | FFFTTFTFFTFFFTFF | 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-177961074200531.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200531
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779734428005
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 18:40:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:40:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:40:29] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-25 18:40:29] [INFO ] Transformed 796 places.
[2026-05-25 18:40:29] [INFO ] Transformed 837 transitions.
[2026-05-25 18:40:29] [INFO ] Found NUPN structural information;
[2026-05-25 18:40:29] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 77 place count 719 transition count 761
Iterating global reduction 1 with 76 rules applied. Total rules applied 153 place count 719 transition count 761
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 186 place count 686 transition count 728
Iterating global reduction 1 with 33 rules applied. Total rules applied 219 place count 686 transition count 728
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 250 place count 686 transition count 697
Applied a total of 250 rules in 191 ms. Remains 686 /796 variables (removed 110) and now considering 697/837 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5503570211584479270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14873091259570051947.kers'
[2026-05-25 18:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5503570211584479270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14873091259570051947.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 686 cols 1795 entries
Finished phase 1 with 644 SingleSign rule and 1 generalized
[2026-05-25 18:40:29] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14873091259570051947.kers
Total runtime 4 ms.
[2026-05-25 18:40:30] [INFO ] Implicit Places using invariants in 381 ms returned []
[2026-05-25 18:40:30] [INFO ] Invariant cache hit.
[2026-05-25 18:40:30] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2026-05-25 18:40:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/685 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/685 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 697/1382 variables, 685/726 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1382/1383 variables, and 726 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 685/686 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/685 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/685 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 697/1382 variables, 685/726 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1382 variables, 696/1422 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1382/1383 variables, and 1422 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 685/686 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in LTL mode, iteration 1 : 686/796 places, 697/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61544 ms. Remains : 686/796 places, 697/837 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Applied a total of 0 rules in 16 ms. Remains 686 /686 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2026-05-25 18:41:31] [INFO ] Invariant cache hit.
[2026-05-25 18:41:31] [INFO ] Implicit Places using invariants in 179 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 535 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 686/686 places, 697/697 transitions.
Support contains 34 out of 686 places after structural reductions.
[2026-05-25 18:41:31] [INFO ] Flatten gal took : 67 ms
[2026-05-25 18:41:32] [INFO ] Flatten gal took : 34 ms
[2026-05-25 18:41:32] [INFO ] Input system was already deterministic with 697 transitions.
RANDOM walk for 40000 steps (118 resets) in 1195 ms. (33 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (11 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 82 ms. (481 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
[2026-05-25 18:41:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 428/442 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 243/685 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 697/1382 variables, 685/726 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1382 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/1383 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1383 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1383/1383 variables, and 727 constraints, problems are : Problem set: 0 solved, 9 unsolved in 992 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 428/442 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 243/685 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 697/1382 variables, 685/726 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1382 variables, 9/735 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1382 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1383 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1383 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1383 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1383/1383 variables, and 736 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2249 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 686/686 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3251ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3631 steps, including 12 resets, run visited all 9 properties in 41 ms. (steps per millisecond=88 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 45 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 129 stabilizing places and 129 stable transitions
Graph (complete) has 1066 edges and 686 vertex of which 642 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(p0) U !p1)&&(p0 U p2)))'
Support contains 5 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 675 transition count 686
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 675 transition count 686
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 675 transition count 684
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 670 transition count 679
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 670 transition count 679
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 670 transition count 675
Applied a total of 38 rules in 52 ms. Remains 670 /686 variables (removed 16) and now considering 675/697 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9123792108670972057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4105211844993492441.kers'
[2026-05-25 18:41:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9123792108670972057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4105211844993492441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 675 rows 670 cols 1751 entries
Finished phase 1 with 628 SingleSign rule and 1 generalized
[2026-05-25 18:41:36] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4105211844993492441.kers
Total runtime 9 ms.
[2026-05-25 18:41:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:41:36] [INFO ] Invariant cache hit.
[2026-05-25 18:41:37] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 674 sub problems to find dead transitions.
[2026-05-25 18:41:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/669 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (OVERLAPS) 675/1344 variables, 669/710 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1344/1345 variables, and 710 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 669/670 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/669 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (OVERLAPS) 675/1344 variables, 669/710 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1344 variables, 674/1384 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1344/1345 variables, and 1384 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 669/670 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 670/686 places, 675/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60911 ms. Remains : 670/686 places, 675/697 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U !p1)&&(p0 U p2)))'
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) p1), true, (NOT p2), (OR (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 5945 steps with 20 reset in 46 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-01 finished in 61317 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)&&F((G(p1)||G(F(!p2))||(!p0&&F(!p2))))))'
Support contains 6 out of 686 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Graph (trivial) has 565 edges and 686 vertex of which 6 / 686 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 1060 edges and 681 vertex of which 637 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 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 335 place count 636 transition count 354
Reduce places removed 333 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 343 rules applied. Total rules applied 678 place count 303 transition count 344
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 682 place count 301 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 684 place count 299 transition count 342
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 684 place count 299 transition count 259
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 850 place count 216 transition count 259
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 890 place count 176 transition count 219
Iterating global reduction 4 with 40 rules applied. Total rules applied 930 place count 176 transition count 219
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 1162 place count 60 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1163 place count 60 transition count 102
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1199 place count 24 transition count 31
Iterating global reduction 5 with 36 rules applied. Total rules applied 1235 place count 24 transition count 31
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 5 with 4 rules applied. Total rules applied 1239 place count 22 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1241 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1242 place count 21 transition count 29
Applied a total of 1242 rules in 69 ms. Remains 21 /686 variables (removed 665) and now considering 29/697 (removed 668) transitions.
[2026-05-25 18:42:37] [INFO ] Flow matrix only has 27 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-7532605970910911122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5290133270209048956.kers'
[2026-05-25 18:42:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7532605970910911122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5290133270209048956.kers]
Normalized transition count is 26 out of 27 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 26 rows 21 cols 70 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-25 18:42:37] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5290133270209048956.kers
Total runtime 0 ms.
[2026-05-25 18:42:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 18:42:37] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2026-05-25 18:42:37] [INFO ] Invariant cache hit.
[2026-05-25 18:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:42:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-25 18:42:38] [INFO ] Redundant transitions in 12 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-25 18:42:38] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2026-05-25 18:42:38] [INFO ] Invariant cache hit.
[2026-05-25 18:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 26/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/47 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/48 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 19 unsolved in 307 ms.
Refiners :[State Equation: 21/21 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 26/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/47 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/48 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 0 solved, 19 unsolved in 293 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 605ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/686 places, 29/697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 21/686 places, 29/697 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)&&F((G(p1)||G(F(p2))||(F(p2)&&p3)))))'
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-02
Stuttering criterion allowed to conclude after 246 steps with 15 reset in 3 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-02 finished in 939 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(p0)))'
Support contains 2 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 673 transition count 684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 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 28 place count 673 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 665 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 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 51 place count 665 transition count 667
Applied a total of 51 rules in 95 ms. Remains 665 /686 variables (removed 21) and now considering 667/697 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5469008242897773722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12561612573617677039.kers'
[2026-05-25 18:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5469008242897773722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12561612573617677039.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:42:38] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12561612573617677039.kers
Total runtime 12 ms.
[2026-05-25 18:42:39] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:42:39] [INFO ] Invariant cache hit.
[2026-05-25 18:42:39] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2026-05-25 18:42:39] [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
Error getting values : (error "Timeout of Z3 solver reached")
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 30027 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
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 30016 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 60145ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 665/686 places, 667/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 665/686 places, 667/697 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(p0)))'
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-05
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-05 finished in 60992 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(G((p0||X(X(p1))))))))'
Support contains 4 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 672 transition count 683
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 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 30 place count 672 transition count 681
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 664 transition count 673
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 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 53 place count 664 transition count 666
Applied a total of 53 rules in 60 ms. Remains 664 /686 variables (removed 22) and now considering 666/697 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15181039227791045381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7462620305850208525.kers'
[2026-05-25 18:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15181039227791045381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7462620305850208525.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:39] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7462620305850208525.kers
Total runtime 3 ms.
[2026-05-25 18:43:40] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 18:43:40] [INFO ] Invariant cache hit.
[2026-05-25 18:43:40] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2026-05-25 18:43:40] [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")
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 30018 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")
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 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 60125ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 664/686 places, 666/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60842 ms. Remains : 664/686 places, 666/697 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(G((X(X(p0))||p1))))))'
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-07
Product exploration explored 100000 steps with 14268 reset in 186 ms.
Product exploration explored 100000 steps with 14217 reset in 218 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.9 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (115 resets) in 255 ms. (156 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2026-05-25 18:44:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 612/663 variables, 39/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 464 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 612/663 variables, 39/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 392 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 867ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 666/666 transitions.
Graph (trivial) has 541 edges and 664 vertex of which 6 / 664 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1028 edges and 659 vertex of which 615 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 615 transition count 333
Reduce places removed 321 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 322 rules applied. Total rules applied 647 place count 294 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 648 place count 293 transition count 332
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 648 place count 293 transition count 250
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 812 place count 211 transition count 250
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 852 place count 171 transition count 210
Iterating global reduction 3 with 40 rules applied. Total rules applied 892 place count 171 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 892 place count 171 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 894 place count 170 transition count 209
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 3 with 244 rules applied. Total rules applied 1138 place count 48 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 134 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 1140 place count 47 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1141 place count 47 transition count 85
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1178 place count 10 transition count 11
Iterating global reduction 5 with 37 rules applied. Total rules applied 1215 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1218 place count 8 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 10 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 7 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1222 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1224 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1224 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1226 place count 4 transition count 5
Applied a total of 1226 rules in 34 ms. Remains 4 /664 variables (removed 660) and now considering 5/666 (removed 661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 4/664 places, 5/666 transitions.
RANDOM walk for 11 steps (1 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 1428 ms.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Support contains 4 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 23 ms. Remains 664 /664 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2026-05-25 18:44:43] [INFO ] Invariant cache hit.
[2026-05-25 18:44:43] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 18:44:43] [INFO ] Invariant cache hit.
[2026-05-25 18:44:43] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 680 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.14 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 33513 steps (97 resets) in 125 ms. (265 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 392 ms.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 14260 reset in 112 ms.
Product exploration explored 100000 steps with 14252 reset in 116 ms.
Spot run failed in 67 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/ltsmin6990829278305166734
[2026-05-25 18:44:44] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6990829278305166734
Running compilation step : cd /tmp/ltsmin6990829278305166734;'/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 1179 ms.
Running link step : cd /tmp/ltsmin6990829278305166734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6990829278305166734;'/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/stateBased13361110550391963188.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-07 finished in 66670 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(X(p0)) U p1)&&F(p2)&&X(p1)))'
Support contains 4 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 673 transition count 684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 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 28 place count 673 transition count 682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 666 transition count 675
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 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 48 place count 666 transition count 669
Applied a total of 48 rules in 57 ms. Remains 666 /686 variables (removed 20) and now considering 669/697 (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-3428276978717248910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2253175660107012149.kers'
[2026-05-25 18:44:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3428276978717248910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2253175660107012149.kers]
Culled 0 columns in 1 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 6 ms
Computed 41 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2253175660107012149.kers
Total runtime 8 ms.
[2026-05-25 18:44:46] [INFO ] Implicit Places using invariants in 177 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 560 ms returned []
Implicit Place search using SMT with State Equation took 738 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
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 30014 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 30016 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 60135ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 666/686 places, 669/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 666/686 places, 669/697 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(X(p0)) U p1)&&F(p2)&&X(p1)))'
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-08
Product exploration explored 100000 steps with 796 reset in 243 ms.
Product exploration explored 100000 steps with 810 reset in 267 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.9 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Knowledge based reduction with 9 factoid took 49 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1030 steps (0 resets) in 6 ms. (147 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
[2026-05-25 18:45:48] [INFO ] Invariant cache hit.
[2026-05-25 18:45:48] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 12 ms returned sat
[2026-05-25 18:45:49] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2026-05-25 18:45:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:45:49] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 12 ms returned sat
[2026-05-25 18:45:49] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2026-05-25 18:45:49] [INFO ] Computed and/alt/rep : 663/871/663 causal constraints (skipped 5 transitions) in 31 ms.
[2026-05-25 18:45:58] [INFO ] Added : 641 causal constraints over 129 iterations in 8631 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 10254 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Support contains 1 out of 666 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Graph (trivial) has 538 edges and 666 vertex of which 6 / 666 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 1032 edges and 661 vertex of which 617 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 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 317 place count 616 transition count 344
Reduce places removed 315 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 318 rules applied. Total rules applied 635 place count 301 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 638 place count 298 transition count 341
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 638 place count 298 transition count 260
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 800 place count 217 transition count 260
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 839 place count 178 transition count 221
Iterating global reduction 3 with 39 rules applied. Total rules applied 878 place count 178 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 3 with 244 rules applied. Total rules applied 1122 place count 56 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1123 place count 56 transition count 98
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1159 place count 20 transition count 27
Iterating global reduction 4 with 36 rules applied. Total rules applied 1195 place count 20 transition count 27
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 1199 place count 18 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1200 place count 17 transition count 25
Applied a total of 1200 rules in 34 ms. Remains 17 /666 variables (removed 649) and now considering 25/669 (removed 644) transitions.
[2026-05-25 18:45:58] [INFO ] Flow matrix only has 24 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-10588143732947805051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15094471319360189880.kers'
[2026-05-25 18:45:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10588143732947805051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15094471319360189880.kers]
Normalized transition count is 23 out of 24 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 23 rows 17 cols 62 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 18:45:58] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15094471319360189880.kers
Total runtime 0 ms.
[2026-05-25 18:45:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 18:45:58] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
[2026-05-25 18:45:58] [INFO ] Invariant cache hit.
[2026-05-25 18:45:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:45:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 18:45:58] [INFO ] Redundant transitions in 10 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-25 18:45:58] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
[2026-05-25 18:45:58] [INFO ] Invariant cache hit.
[2026-05-25 18:45:58] [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, 16 unsolved
At refinement iteration 1 (OVERLAPS) 23/35 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/40 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 18 constraints, problems are : Problem set: 0 solved, 16 unsolved in 200 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 23/35 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 5/40 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 234 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 439ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/666 places, 25/669 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 17/666 places, 25/669 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
[2026-05-25 18:45:59] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
[2026-05-25 18:45:59] [INFO ] Invariant cache hit.
[2026-05-25 18:45:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 18:45:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:45:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 18:45:59] [INFO ] Computed and/alt/rep : 14/24/14 causal constraints (skipped 2 transitions) in 1 ms.
[2026-05-25 18:45:59] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 366 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-08 finished in 73067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 1 out of 686 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Graph (trivial) has 572 edges and 686 vertex of which 6 / 686 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 1060 edges and 681 vertex of which 637 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 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 636 transition count 347
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 349 rules applied. Total rules applied 691 place count 296 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 295 transition count 338
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 692 place count 295 transition count 254
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 860 place count 211 transition count 254
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 900 place count 171 transition count 214
Iterating global reduction 3 with 40 rules applied. Total rules applied 940 place count 171 transition count 214
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 1182 place count 50 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1183 place count 50 transition count 92
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1222 place count 11 transition count 15
Iterating global reduction 4 with 39 rules applied. Total rules applied 1261 place count 11 transition count 15
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 1265 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1267 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1268 place count 8 transition count 13
Applied a total of 1268 rules in 33 ms. Remains 8 /686 variables (removed 678) and now considering 13/697 (removed 684) transitions.
[2026-05-25 18:45:59] [INFO ] Flow matrix only has 12 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-9854827450680415749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1555038666932314682.kers'
[2026-05-25 18:45:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9854827450680415749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1555038666932314682.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 26 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 18:45:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1555038666932314682.kers
Total runtime 0 ms.
[2026-05-25 18:45:59] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-25 18:45:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 18:45:59] [INFO ] Invariant cache hit.
[2026-05-25 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:45:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 18:45:59] [INFO ] Redundant transitions in 9 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 18:45:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 18:45:59] [INFO ] Invariant cache hit.
[2026-05-25 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 83 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/686 places, 13/697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 8/686 places, 13/697 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-10
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-10 finished in 304 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)) U (G(p1) U (p2&&G(p0)))))'
Support contains 7 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 678 transition count 689
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 678 transition count 689
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 673 transition count 684
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 673 transition count 684
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 673 transition count 679
Applied a total of 31 rules in 54 ms. Remains 673 /686 variables (removed 13) and now considering 679/697 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15256976158947296792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4482498289881160624.kers'
[2026-05-25 18:45:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15256976158947296792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4482498289881160624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 679 rows 673 cols 1759 entries
Finished phase 1 with 631 SingleSign rule and 1 generalized
[2026-05-25 18:45:59] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4482498289881160624.kers
Total runtime 3 ms.
[2026-05-25 18:46:00] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-25 18:46:00] [INFO ] Invariant cache hit.
[2026-05-25 18:46:00] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 678 sub problems to find dead transitions.
[2026-05-25 18:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/672 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (OVERLAPS) 679/1351 variables, 672/713 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1351/1352 variables, and 713 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 672/673 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/672 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (OVERLAPS) 679/1351 variables, 672/713 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1351 variables, 678/1391 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1351/1352 variables, and 1391 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 672/673 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 673/686 places, 679/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60847 ms. Remains : 673/686 places, 679/697 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)) U (G(p1) U (p2&&G(p0)))))'
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-11
Product exploration explored 100000 steps with 24999 reset in 174 ms.
Product exploration explored 100000 steps with 25009 reset in 197 ms.
Computed a total of 126 stabilizing places and 126 stable transitions
Graph (complete) has 1048 edges and 673 vertex of which 629 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 126 stabilizing places and 126 stable transitions
Knowledge based reduction with 13 factoid took 76 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (117 resets) in 216 ms. (184 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 214 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
[2026-05-25 18:47:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 158/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 507/672 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 679/1351 variables, 672/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/1352 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1352 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1352 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 714 constraints, problems are : Problem set: 0 solved, 9 unsolved in 911 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 158/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 507/672 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 679/1351 variables, 672/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 9/722 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1351 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1352 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1352 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1352 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 723 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1943 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2861ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 938 ms.
Support contains 7 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 679/679 transitions.
Graph (trivial) has 542 edges and 673 vertex of which 6 / 673 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1041 edges and 668 vertex of which 624 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 624 transition count 349
Reduce places removed 318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 319 rules applied. Total rules applied 641 place count 306 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 305 transition count 348
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 642 place count 305 transition count 267
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 804 place count 224 transition count 267
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 845 place count 183 transition count 226
Iterating global reduction 3 with 41 rules applied. Total rules applied 886 place count 183 transition count 226
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1126 place count 63 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1127 place count 63 transition count 105
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1161 place count 29 transition count 37
Iterating global reduction 4 with 34 rules applied. Total rules applied 1195 place count 29 transition count 37
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 4 with 2 rules applied. Total rules applied 1197 place count 28 transition count 36
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1198 place count 28 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1206 place count 24 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1208 place count 24 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1212 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1213 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1214 place count 22 transition count 28
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1216 place count 21 transition count 27
Applied a total of 1216 rules in 23 ms. Remains 21 /673 variables (removed 652) and now considering 27/679 (removed 652) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 21/673 places, 27/679 transitions.
RANDOM walk for 3771 steps (25 resets) in 10 ms. (342 steps per ms) remains 0/5 properties
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 13 factoid took 121 ms. Proved property starting from automaton with 11 states, 30 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 4415 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-11 finished in 66058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 2 out of 686 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 697/697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 672 transition count 683
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 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 30 place count 672 transition count 681
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 664 transition count 673
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 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 53 place count 664 transition count 666
Applied a total of 53 rules in 48 ms. Remains 664 /686 variables (removed 22) and now considering 666/697 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2423601929206506331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1798450629751983509.kers'
[2026-05-25 18:47:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2423601929206506331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1798450629751983509.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 666 rows 664 cols 1733 entries
Finished phase 1 with 622 SingleSign rule and 1 generalized
[2026-05-25 18:47:05] [INFO ] Computed 41 invariants in 5 ms
Computed 41 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1798450629751983509.kers
Total runtime 6 ms.
[2026-05-25 18:47:06] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 18:47:06] [INFO ] Invariant cache hit.
[2026-05-25 18:47:06] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2026-05-25 18:47:06] [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
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
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 30016 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 60115ms 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/686 places, 666/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60808 ms. Remains : 664/686 places, 666/697 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-15 finished in 61031 ms.
All properties solved by simple procedures.
Total runtime 457847 ms.
BK_STOP 1779734886972
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-40b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-40b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200531"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;