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.r066-tall-177946967700387.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 CO4-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 174K 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 CO4-PT-14-LTLCardinality-00
FORMULA_NAME CO4-PT-14-LTLCardinality-01
FORMULA_NAME CO4-PT-14-LTLCardinality-02
FORMULA_NAME CO4-PT-14-LTLCardinality-03
FORMULA_NAME CO4-PT-14-LTLCardinality-04
FORMULA_NAME CO4-PT-14-LTLCardinality-05
FORMULA_NAME CO4-PT-14-LTLCardinality-06
FORMULA_NAME CO4-PT-14-LTLCardinality-07
FORMULA_NAME CO4-PT-14-LTLCardinality-08
FORMULA_NAME CO4-PT-14-LTLCardinality-09
FORMULA_NAME CO4-PT-14-LTLCardinality-10
FORMULA_NAME CO4-PT-14-LTLCardinality-11
FORMULA_NAME CO4-PT-14-LTLCardinality-12
FORMULA_NAME CO4-PT-14-LTLCardinality-13
FORMULA_NAME CO4-PT-14-LTLCardinality-14
FORMULA_NAME CO4-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779523291922

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 08:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:01:33] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-23 08:01:33] [INFO ] Transformed 680 places.
[2026-05-23 08:01:33] [INFO ] Transformed 812 transitions.
[2026-05-23 08:01:33] [INFO ] Found NUPN structural information;
[2026-05-23 08:01:33] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 196 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 4 formulas.
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 570 transition count 691
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 132 place count 449 transition count 568
Iterating global reduction 1 with 121 rules applied. Total rules applied 253 place count 449 transition count 568
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 256 place count 449 transition count 565
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 316 place count 389 transition count 505
Iterating global reduction 2 with 60 rules applied. Total rules applied 376 place count 389 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 389 transition count 504
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 385 place count 381 transition count 495
Iterating global reduction 3 with 8 rules applied. Total rules applied 393 place count 381 transition count 495
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 396 place count 381 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 397 place count 380 transition count 491
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 380 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 399 place count 379 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 379 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 401 place count 379 transition count 489
Applied a total of 401 rules in 157 ms. Remains 379 /580 variables (removed 201) and now considering 489/692 (removed 203) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16629873876989994116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15998214325722107467.kers'
[2026-05-23 08:01:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16629873876989994116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15998214325722107467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 379 cols 1113 entries
Finished phase 1 with 374 SingleSign rule and 0 generalized
[2026-05-23 08:01:33] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15998214325722107467.kers
Total runtime 3 ms.
[2026-05-23 08:01:33] [INFO ] Implicit Places using invariants in 288 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 378/580 places, 489/692 transitions.
Applied a total of 0 rules in 11 ms. Remains 378 /378 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 378/580 places, 489/692 transitions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1973068405062375777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8528937196095901171.kers'
[2026-05-23 08:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1973068405062375777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8528937196095901171.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 378 cols 1111 entries
Finished phase 1 with 374 SingleSign rule and 0 generalized
[2026-05-23 08:01:34] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8528937196095901171.kers
Total runtime 2 ms.
[2026-05-23 08:01:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:01:34] [INFO ] Invariant cache hit.
[2026-05-23 08:01:34] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2026-05-23 08:01:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (OVERLAPS) 489/866 variables, 377/381 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 383 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 377/378 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (OVERLAPS) 489/866 variables, 377/383 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 487/870 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 871 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 377/378 constraints, PredecessorRefiner: 487/488 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 378/378 places, 489/489 transitions.
Support contains 28 out of 378 places after structural reductions.
[2026-05-23 08:02:34] [INFO ] Flatten gal took : 51 ms
[2026-05-23 08:02:34] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:02:34] [INFO ] Input system was already deterministic with 489 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (74 resets) in 1099 ms. (36 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40000 steps (60 resets) in 500 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (40 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (78 resets) in 157 ms. (253 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40000 steps (87 resets) in 151 ms. (263 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (74 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (146 resets) in 118 ms. (336 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (95 resets) in 171 ms. (232 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (76 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (40 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (74 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
[2026-05-23 08:02:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/39 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 131/170 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 22/192 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 368/560 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 260/820 variables, 152/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 43/863 variables, 30/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/863 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/867 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/867 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/867 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 867/867 variables, and 382 constraints, problems are : Problem set: 0 solved, 8 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 26/39 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 131/170 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 22/192 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 368/560 variables, 153/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 260/820 variables, 152/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 43/863 variables, 30/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 4/867 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/867 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/867 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 867/867 variables, and 390 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2598ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 54 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 299 ms.
FORMULA CO4-PT-14-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-14-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-14-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 630 edges and 378 vertex of which 373 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Graph (trivial) has 401 edges and 378 vertex of which 2 / 378 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 629 edges and 377 vertex of which 372 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 371 transition count 347
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 143 rules applied. Total rules applied 280 place count 236 transition count 339
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 287 place count 229 transition count 339
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 287 place count 229 transition count 296
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 373 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 375 place count 184 transition count 293
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 184 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 184 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 378 place count 184 transition count 291
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 380 place count 183 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 381 place count 182 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 182 transition count 290
Performed 61 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 504 place count 121 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 510 place count 121 transition count 206
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 515 place count 116 transition count 201
Iterating global reduction 5 with 5 rules applied. Total rules applied 520 place count 116 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 521 place count 116 transition count 200
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 527 place count 113 transition count 197
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 591 place count 81 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 609 place count 81 transition count 181
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 636 place count 54 transition count 127
Iterating global reduction 7 with 27 rules applied. Total rules applied 663 place count 54 transition count 127
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 680 place count 54 transition count 110
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 687 place count 47 transition count 90
Iterating global reduction 8 with 7 rules applied. Total rules applied 694 place count 47 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 699 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 704 place count 47 transition count 80
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 706 place count 47 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 708 place count 45 transition count 78
Applied a total of 708 rules in 100 ms. Remains 45 /378 variables (removed 333) and now considering 78/489 (removed 411) transitions.
[2026-05-23 08:02:39] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1836467183046740846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6776980675885869838.kers'
[2026-05-23 08:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1836467183046740846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6776980675885869838.kers]
Normalized transition count is 72 out of 73 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 45 cols 199 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-23 08:02:39] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6776980675885869838.kers
Total runtime 1 ms.
[2026-05-23 08:02:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 08:02:39] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2026-05-23 08:02:39] [INFO ] Invariant cache hit.
[2026-05-23 08:02:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:02:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-23 08:02:39] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-23 08:02:39] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2026-05-23 08:02:39] [INFO ] Invariant cache hit.
[2026-05-23 08:02:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 72/117 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/118 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 51 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 72/117 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 65/115 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 116 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3027ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/378 places, 78/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3224 ms. Remains : 45/378 places, 78/489 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-01
Product exploration explored 100000 steps with 9 reset in 164 ms.
Product exploration explored 100000 steps with 13 reset in 80 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 1671 steps (168 resets) in 31 ms. (52 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 294 ms.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-23 08:02:43] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2026-05-23 08:02:43] [INFO ] Invariant cache hit.
[2026-05-23 08:02:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 08:02:43] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2026-05-23 08:02:43] [INFO ] Invariant cache hit.
[2026-05-23 08:02:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:02:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-23 08:02:43] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 45/45 places, 78/78 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge based reduction with 5 factoid took 55 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 2606 steps (271 resets) in 26 ms. (96 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 285 ms.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 82 ms.
Product exploration explored 100000 steps with 6 reset in 73 ms.
Built C files in :
/tmp/ltsmin11381618694572704968
[2026-05-23 08:02:44] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2026-05-23 08:02:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:44] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2026-05-23 08:02:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:44] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2026-05-23 08:02:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:02:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11381618694572704968
Running compilation step : cd /tmp/ltsmin11381618694572704968;'/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 287 ms.
Running link step : cd /tmp/ltsmin11381618694572704968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11381618694572704968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8230822080803932560.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA CO4-PT-14-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLCardinality-01 finished in 5602 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&&G(p1)) U X(X(p0)))))'
Support contains 3 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 489
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 366 transition count 477
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 366 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 366 transition count 475
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 360 transition count 469
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 360 transition count 469
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 357 transition count 465
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 357 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 357 transition count 464
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 356 transition count 463
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 356 transition count 463
Applied a total of 46 rules in 51 ms. Remains 356 /378 variables (removed 22) and now considering 463/489 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2260929105163281222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7679306228621981132.kers'
[2026-05-23 08:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2260929105163281222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7679306228621981132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 356 cols 1059 entries
Finished phase 1 with 352 SingleSign rule and 0 generalized
[2026-05-23 08:02:44] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7679306228621981132.kers
Total runtime 4 ms.
[2026-05-23 08:02:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-23 08:02:44] [INFO ] Invariant cache hit.
[2026-05-23 08:02:45] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-23 08:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 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 819/819 variables, and 825 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 356/378 places, 463/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 356/378 places, 463/489 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)&&p1) U X(X(p1)))))'
Stuttering acceptance computed with spot in 406 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 199 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 604 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge based reduction with 9 factoid took 69 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 835 steps (23 resets) in 6 ms. (119 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 56 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 308 ms.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 356 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2026-05-23 08:03:46] [INFO ] Invariant cache hit.
[2026-05-23 08:03:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 08:03:46] [INFO ] Invariant cache hit.
[2026-05-23 08:03:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 604 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 801 steps (22 resets) in 6 ms. (114 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 301 ms.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 111 ms.
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Spot run failed in 75 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/ltsmin1773600864517371622
[2026-05-23 08:03:47] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1773600864517371622
Running compilation step : cd /tmp/ltsmin1773600864517371622;'/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 634 ms.
Running link step : cd /tmp/ltsmin1773600864517371622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1773600864517371622;'/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/stateBased16239085430649391037.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA CO4-PT-14-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLCardinality-03 finished in 63945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1))) U X((p2||G(p3)))))'
Support contains 5 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 369 transition count 479
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 369 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 369 transition count 478
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 363 transition count 472
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 363 transition count 472
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 360 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 360 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 360 transition count 467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 359 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 359 transition count 466
Applied a total of 40 rules in 29 ms. Remains 359 /378 variables (removed 19) and now considering 466/489 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10307409584871824384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1796004233912754513.kers'
[2026-05-23 08:03:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10307409584871824384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1796004233912754513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 466 rows 359 cols 1065 entries
Finished phase 1 with 355 SingleSign rule and 0 generalized
[2026-05-23 08:03:48] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1796004233912754513.kers
Total runtime 5 ms.
[2026-05-23 08:03:48] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 08:03:48] [INFO ] Invariant cache hit.
[2026-05-23 08:03:48] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-23 08:03:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/824 variables, 358/362 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 824/825 variables, and 364 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/359 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (OVERLAPS) 466/824 variables, 358/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 464/828 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/825 variables, and 829 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/359 constraints, PredecessorRefiner: 464/465 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 359/378 places, 466/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60392 ms. Remains : 359/378 places, 466/489 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1))) U X((G(p2)||p3))))'
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-04 finished in 60862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(F(p1)))))||X(F(p0))))'
Support contains 3 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 489
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 366 transition count 477
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 366 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 366 transition count 475
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 359 transition count 468
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 359 transition count 468
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 355 transition count 463
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 355 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 354 transition count 461
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 354 transition count 461
Applied a total of 50 rules in 28 ms. Remains 354 /378 variables (removed 24) and now considering 461/489 (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-4293148135638824097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5659949385392451762.kers'
[2026-05-23 08:04:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4293148135638824097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5659949385392451762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 354 cols 1053 entries
Finished phase 1 with 350 SingleSign rule and 0 generalized
[2026-05-23 08:04:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5659949385392451762.kers
Total runtime 2 ms.
[2026-05-23 08:04:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 08:04:49] [INFO ] Invariant cache hit.
[2026-05-23 08:04:49] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-23 08:04:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 821 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 354/378 places, 461/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60381 ms. Remains : 354/378 places, 461/489 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(F(p1)))))||X(F(p0))))'
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 16 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA CO4-PT-14-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-14-LTLCardinality-07 finished in 60961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((G(p2)||p1))))))'
Support contains 4 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 489
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 366 transition count 478
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 366 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 366 transition count 476
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 360 transition count 470
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 360 transition count 470
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 357 transition count 466
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 357 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 356 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 356 transition count 465
Applied a total of 45 rules in 26 ms. Remains 356 /378 variables (removed 22) and now considering 465/489 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-618362225513271689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8225898531895336611.kers'
[2026-05-23 08:05:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-618362225513271689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8225898531895336611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 356 cols 1061 entries
Finished phase 1 with 352 SingleSign rule and 0 generalized
[2026-05-23 08:05:50] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8225898531895336611.kers
Total runtime 4 ms.
[2026-05-23 08:05:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-23 08:05:50] [INFO ] Invariant cache hit.
[2026-05-23 08:05:50] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-23 08:05:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/821 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 362 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/821 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 464/826 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 827 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 356/378 places, 465/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 356/378 places, 465/489 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((G(p1)||p0)))&&p2)))'
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-14-LTLCardinality-10
Product exploration explored 100000 steps with 18 reset in 93 ms.
Product exploration explored 100000 steps with 1 reset in 101 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 604 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge based reduction with 6 factoid took 68 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (98 resets) in 140 ms. (283 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (52 resets) in 180 ms. (220 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (103 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (80 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
[2026-05-23 08:06:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/206 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/214 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 251/481 variables, 113/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 238/719 variables, 116/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 94/813 variables, 62/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/813 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/821 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/821 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/821 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/206 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/214 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/230 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 251/481 variables, 113/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 238/719 variables, 116/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 94/813 variables, 62/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/813 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/821 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/821 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/821 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 364 constraints, problems are : Problem set: 0 solved, 3 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1832 ms.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 465/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2026-05-23 08:06:53] [INFO ] Invariant cache hit.
[2026-05-23 08:06:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 08:06:53] [INFO ] Invariant cache hit.
[2026-05-23 08:06:53] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 356/356 places, 465/465 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 604 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge based reduction with 5 factoid took 53 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (77 resets) in 102 ms. (388 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (56 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (47 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (78 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2026-05-23 08:06:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/206 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/214 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 251/481 variables, 113/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 238/719 variables, 116/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 94/813 variables, 62/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/813 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/821 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/821 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/821 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/206 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/214 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/230 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 251/481 variables, 113/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 238/719 variables, 116/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 94/813 variables, 62/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/813 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/821 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/821 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/821 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 364 constraints, problems are : Problem set: 0 solved, 3 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1219ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1304 steps, including 30 resets, run visited all 3 properties in 5 ms. (steps per millisecond=260 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1740 ms.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 10 reset in 86 ms.
Product exploration explored 100000 steps with 6 reset in 90 ms.
Spot run failed in 47 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/ltsmin5142984000714388619
[2026-05-23 08:06:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5142984000714388619
Running compilation step : cd /tmp/ltsmin5142984000714388619;'/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 642 ms.
Running link step : cd /tmp/ltsmin5142984000714388619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5142984000714388619;'/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/stateBased5838845796918621884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 465/465 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2026-05-23 08:07:10] [INFO ] Invariant cache hit.
[2026-05-23 08:07:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 08:07:11] [INFO ] Invariant cache hit.
[2026-05-23 08:07:11] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 356/356 places, 465/465 transitions.
Built C files in :
/tmp/ltsmin1242026000639374731
[2026-05-23 08:07:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1242026000639374731
Running compilation step : cd /tmp/ltsmin1242026000639374731;'/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 656 ms.
Running link step : cd /tmp/ltsmin1242026000639374731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1242026000639374731;'/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/stateBased5496094560248932681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 08:07:26] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:07:26] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:07:26] [INFO ] Time to serialize gal into /tmp/LTL12720641228207588377.gal : 5 ms
[2026-05-23 08:07:26] [INFO ] Time to serialize properties into /tmp/LTL10978363458668576555.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12720641228207588377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut700092119038775114.hoa' '-atoms' '/tmp/LTL10978363458668576555.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10978363458668576555.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut700092119038775114.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t37, t38, t40, t41, t45, t46, t50, t51, t54, t141, t172, t2...403
Computing Next relation with stutter on 19583 deadlock states
Detected timeout of ITS tools.
[2026-05-23 08:07:41] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:07:41] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:07:41] [INFO ] Time to serialize gal into /tmp/LTL18254997668885066040.gal : 3 ms
[2026-05-23 08:07:41] [INFO ] Time to serialize properties into /tmp/LTL13128563690389735397.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18254997668885066040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13128563690389735397.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("((p188==0)||(p289==1))")||(G("((p589==0)||(p601==1))")))))&&("((p188==0)||(p289==1))"))))
Formula 0 simplified : X(!"((p188==0)||(p289==1))" | XF(!"((p188==0)||(p289==1))" & F!"((p589==0)||(p601==1))"))
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t37, t38, t40, t41, t45, t46, t50, t51, t54, t141, t172, t2...403
Computing Next relation with stutter on 19583 deadlock states
Detected timeout of ITS tools.
[2026-05-23 08:07:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:07:56] [INFO ] Applying decomposition
[2026-05-23 08:07:56] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7528128372889044101.txt' '-o' '/tmp/graph7528128372889044101.bin' '-w' '/tmp/graph7528128372889044101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7528128372889044101.bin' '-l' '-1' '-v' '-w' '/tmp/graph7528128372889044101.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:07:56] [INFO ] Decomposing Gal with order
[2026-05-23 08:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:07:56] [INFO ] Removed a total of 154 redundant transitions.
[2026-05-23 08:07:56] [INFO ] Flatten gal took : 77 ms
[2026-05-23 08:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 11 ms.
[2026-05-23 08:07:56] [INFO ] Time to serialize gal into /tmp/LTL14681811924215037360.gal : 6 ms
[2026-05-23 08:07:56] [INFO ] Time to serialize properties into /tmp/LTL7243936837160022610.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14681811924215037360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7243936837160022610.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("((i1.i0.u25.p188==0)||(i5.i0.u44.p289==1))")||(G("((i7.i0.u111.p589==0)||(i17.u113.p601==1))")))))&&("((i1.i0.u25.p188==0)...182
Formula 0 simplified : X(!"((i1.i0.u25.p188==0)||(i5.i0.u44.p289==1))" | XF(!"((i1.i0.u25.p188==0)||(i5.i0.u44.p289==1))" & F!"((i7.i0.u111.p589==0)||(i17....172
Reverse transition relation is NOT exact ! Due to transitions t54, t78, t210, t258, t261, t331, t392, t432, i0.i1.t389, i0.i1.u8.t397, i1.i0.u25.t373, i2.i...676
Computing Next relation with stutter on 19583 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
41 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.453196,33616,1,0,32902,2563,5477,56502,470,11903,84004
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-14-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-14-LTLCardinality-10 finished in 126885 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(p1)&&F(p2)))'
Support contains 5 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 489/489 transitions.
Graph (trivial) has 404 edges and 378 vertex of which 2 / 378 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 629 edges and 377 vertex of which 372 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 371 transition count 345
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 234 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 233 transition count 343
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 279 place count 233 transition count 300
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 365 place count 190 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 367 place count 188 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 188 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 188 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 370 place count 188 transition count 295
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 372 place count 187 transition count 295
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 494 place count 126 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 500 place count 126 transition count 213
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 505 place count 121 transition count 208
Iterating global reduction 5 with 5 rules applied. Total rules applied 510 place count 121 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 121 transition count 207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 515 place count 119 transition count 205
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 581 place count 86 transition count 208
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 601 place count 86 transition count 188
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 628 place count 59 transition count 134
Iterating global reduction 7 with 27 rules applied. Total rules applied 655 place count 59 transition count 134
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 673 place count 59 transition count 116
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 679 place count 53 transition count 99
Iterating global reduction 8 with 6 rules applied. Total rules applied 685 place count 53 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 689 place count 53 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 691 place count 52 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 702 place count 52 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 702 place count 52 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 704 place count 51 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 706 place count 49 transition count 98
Applied a total of 706 rules in 51 ms. Remains 49 /378 variables (removed 329) and now considering 98/489 (removed 391) transitions.
[2026-05-23 08:07:57] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12824572226781037883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-256030575176297735.kers'
[2026-05-23 08:07:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12824572226781037883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-256030575176297735.kers]
Normalized transition count is 88 out of 89 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 49 cols 264 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-23 08:07:57] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-256030575176297735.kers
Total runtime 1 ms.
[2026-05-23 08:07:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 08:07:57] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2026-05-23 08:07:57] [INFO ] Invariant cache hit.
[2026-05-23 08:07:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:07:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2026-05-23 08:07:57] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2026-05-23 08:07:57] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2026-05-23 08:07:57] [INFO ] Invariant cache hit.
[2026-05-23 08:07:57] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 88/137 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 57 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 88/137 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 85/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 142 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4653ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4655ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/378 places, 98/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4814 ms. Remains : 49/378 places, 98/489 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(p1)&&F(p2)))'
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-14
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-14 finished in 5008 ms.
All properties solved by simple procedures.
Total runtime 389251 ms.

BK_STOP 1779523682426

--------------------
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="CO4-PT-14"
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 CO4-PT-14, 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 r066-tall-177946967700387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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