fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876812500428
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 623374.00 0.00 0.00 FFFFFFFFFFFFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812500428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Parking-PT-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812500428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 192K May 29 14:32 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 Parking-PT-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748885180973

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 17:26:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:26:22] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-02 17:26:22] [INFO ] Transformed 529 places.
[2025-06-02 17:26:22] [INFO ] Transformed 785 transitions.
[2025-06-02 17:26:22] [INFO ] Found NUPN structural information;
[2025-06-02 17:26:22] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Support contains 60 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 89 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2025-06-02 17:26:22] [INFO ] Computed 124 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:23] [INFO ] Implicit Places using invariants in 528 ms returned [64, 72, 80, 88, 104, 112, 120, 144, 189, 197, 205, 213, 221, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 577 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/529 places, 453/457 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 460 transition count 425
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 460 transition count 425
Applied a total of 56 rules in 32 ms. Remains 460 /488 variables (removed 28) and now considering 425/453 (removed 28) transitions.
// Phase 1: matrix 425 rows 460 cols
[2025-06-02 17:26:23] [INFO ] Computed 87 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:23] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-02 17:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:23] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:26:24] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 460/529 places, 425/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2245 ms. Remains : 460/529 places, 425/457 transitions.
Support contains 60 out of 460 places after structural reductions.
[2025-06-02 17:26:25] [INFO ] Flatten gal took : 60 ms
[2025-06-02 17:26:25] [INFO ] Flatten gal took : 35 ms
[2025-06-02 17:26:25] [INFO ] Input system was already deterministic with 425 transitions.
RANDOM walk for 40000 steps (361 resets) in 1283 ms. (31 steps per ms) remains 9/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
[2025-06-02 17:26:26] [INFO ] Invariant cache hit.
[2025-06-02 17:26:26] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 218/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 225/460 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 425/885 variables, 460/547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/885 variables, 108/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/885 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/885 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 885/885 variables, and 655 constraints, problems are : Problem set: 0 solved, 9 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 460/460 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 218/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 225/460 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 425/885 variables, 460/547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/885 variables, 108/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/885 variables, 9/664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:28] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:28] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/885 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/885 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/885 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 885/885 variables, and 666 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3375 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 460/460 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4251ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 5 properties in 3232 ms.
Support contains 8 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 460 transition count 409
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 444 transition count 409
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 444 transition count 393
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 428 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 426 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 426 transition count 391
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 405 transition count 370
Free-agglomeration rule applied 95 times.
Iterating global reduction 2 with 95 rules applied. Total rules applied 205 place count 405 transition count 275
Reduce places removed 95 places and 0 transitions.
Graph (complete) has 620 edges and 310 vertex of which 161 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 127 output transitions
Drop transitions (Output transitions of discarded places.) removed 127 transitions
Iterating post reduction 2 with 96 rules applied. Total rules applied 301 place count 161 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 309 place count 161 transition count 140
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 161 transition count 140
Applied a total of 310 rules in 107 ms. Remains 161 /460 variables (removed 299) and now considering 140/425 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 161/460 places, 140/425 transitions.
RANDOM walk for 40000 steps (425 resets) in 375 ms. (106 steps per ms) remains 1/4 properties
BEST_FIRST walk for 1991 steps (0 resets) in 10 ms. (181 steps per ms) remains 0/1 properties
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X((p0&&X(p1))))))&&F((p1&&F(p2))))))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 26 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:26:34] [INFO ] Computed 87 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:34] [INFO ] Implicit Places using invariants in 232 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 234 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 29 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:26:34] [INFO ] Computed 84 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:34] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-02 17:26:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:35] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:26:36] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1818 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 713 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-00
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 4 ms.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-00 finished in 2599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 460 transition count 410
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 445 transition count 410
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 445 transition count 395
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 430 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 427 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 427 transition count 392
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 110 place count 405 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 404 transition count 377
Applied a total of 112 rules in 62 ms. Remains 404 /460 variables (removed 56) and now considering 377/425 (removed 48) transitions.
// Phase 1: matrix 377 rows 404 cols
[2025-06-02 17:26:37] [INFO ] Computed 87 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:37] [INFO ] Implicit Places using invariants in 210 ms returned [82, 119, 213]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 212 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/460 places, 377/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 400 transition count 376
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 400 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 399 transition count 375
Applied a total of 4 rules in 31 ms. Remains 399 /401 variables (removed 2) and now considering 375/377 (removed 2) transitions.
// Phase 1: matrix 375 rows 399 cols
[2025-06-02 17:26:37] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:37] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 17:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:37] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-02 17:26:39] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/460 places, 375/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2373 ms. Remains : 399/460 places, 375/425 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-01
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 4 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 2433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)&&X((X(p2)&&F(p3)))))'
Support contains 6 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 423
Applied a total of 4 rules in 14 ms. Remains 458 /460 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 458 cols
[2025-06-02 17:26:39] [INFO ] Computed 87 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:39] [INFO ] Implicit Places using invariants in 212 ms returned [89, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 213 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/460 places, 423/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 455 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 422
Applied a total of 2 rules in 13 ms. Remains 455 /456 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 455 cols
[2025-06-02 17:26:39] [INFO ] Computed 85 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:39] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 17:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:40] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:26:41] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/460 places, 422/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2130 ms. Remains : 455/460 places, 422/425 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), true]
Running random walk in product with property : Parking-PT-432-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-02 finished in 2423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 459 transition count 409
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 444 transition count 409
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 444 transition count 394
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 429 transition count 394
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 426 transition count 391
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 426 transition count 391
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 108 place count 405 transition count 370
Applied a total of 108 rules in 34 ms. Remains 405 /460 variables (removed 55) and now considering 370/425 (removed 55) transitions.
// Phase 1: matrix 370 rows 405 cols
[2025-06-02 17:26:41] [INFO ] Computed 87 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:42] [INFO ] Implicit Places using invariants in 226 ms returned [81, 118, 214]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 228 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/460 places, 370/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 401 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 401 transition count 369
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 0 with 4 rules applied. Total rules applied 6 place count 399 transition count 367
Applied a total of 6 rules in 40 ms. Remains 399 /402 variables (removed 3) and now considering 367/370 (removed 3) transitions.
// Phase 1: matrix 367 rows 399 cols
[2025-06-02 17:26:42] [INFO ] Computed 84 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 17:26:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:42] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 399/460 places, 367/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 759 ms. Remains : 399/460 places, 367/425 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-03
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 2 ms.
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-03 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 460 transition count 409
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 444 transition count 409
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 444 transition count 393
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 428 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 425 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 425 transition count 390
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 403 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 402 transition count 375
Applied a total of 116 rules in 48 ms. Remains 402 /460 variables (removed 58) and now considering 375/425 (removed 50) transitions.
// Phase 1: matrix 375 rows 402 cols
[2025-06-02 17:26:42] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:42] [INFO ] Implicit Places using invariants in 208 ms returned [82, 119, 213]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 209 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/460 places, 375/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 398 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 398 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 397 transition count 373
Applied a total of 4 rules in 28 ms. Remains 397 /399 variables (removed 2) and now considering 373/375 (removed 2) transitions.
// Phase 1: matrix 373 rows 397 cols
[2025-06-02 17:26:43] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:43] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-02 17:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:43] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-02 17:26:44] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/460 places, 373/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1562 ms. Remains : 397/460 places, 373/425 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-04
Product exploration explored 100000 steps with 2098 reset in 537 ms.
Product exploration explored 100000 steps with 2084 reset in 540 ms.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 373/373 transitions.
Applied a total of 0 rules in 19 ms. Remains 397 /397 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2025-06-02 17:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:46] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 17:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:46] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-02 17:26:47] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:26:47] [INFO ] Redundant transitions in 24 ms returned []
Running 364 sub problems to find dead transitions.
[2025-06-02 17:26:47] [INFO ] Invariant cache hit.
[2025-06-02 17:26:47] [INFO ] State equation strengthened by 156 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 373/770 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 156/637 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/770 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/770 variables, and 637 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 373/770 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 156/637 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/770 variables, 364/1001 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/770 variables, and 1001 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61607 ms. Remains : 397/397 places, 373/373 transitions.
Computed a total of 1 stabilizing places and 9 stable transitions
Computed a total of 1 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2094 reset in 479 ms.
Product exploration explored 100000 steps with 2082 reset in 494 ms.
Built C files in :
/tmp/ltsmin12791494936383526370
[2025-06-02 17:27:49] [INFO ] Computing symmetric may disable matrix : 373 transitions.
[2025-06-02 17:27:49] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:27:49] [INFO ] Computing symmetric may enable matrix : 373 transitions.
[2025-06-02 17:27:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:27:49] [INFO ] Computing Do-Not-Accords matrix : 373 transitions.
[2025-06-02 17:27:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:27:49] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12791494936383526370
Running compilation step : cd /tmp/ltsmin12791494936383526370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 921 ms.
Running link step : cd /tmp/ltsmin12791494936383526370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12791494936383526370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10060144456173023980.hoa' '--buchi-type=spotba'
LTSmin run took 2392 ms.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLFireability-04 finished in 70561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(!(X(p0) U p1)) U G(!p2))))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 18 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:27:53] [INFO ] Computed 87 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:53] [INFO ] Implicit Places using invariants in 220 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 221 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 12 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:27:53] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:53] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-02 17:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:53] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:27:55] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1752 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 313 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Running random walk in product with property : Parking-PT-432-LTLFireability-05
Product exploration explored 100000 steps with 24646 reset in 693 ms.
Product exploration explored 100000 steps with 24685 reset in 713 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
RANDOM walk for 26652 steps (238 resets) in 292 ms. (90 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 447 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 291 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Support contains 4 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-06-02 17:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:58] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 17:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:58] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:28:00] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2025-06-02 17:28:00] [INFO ] Invariant cache hit.
[2025-06-02 17:28:00] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 61618 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
RANDOM walk for 38897 steps (354 resets) in 244 ms. (158 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 467 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 323 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 313 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Product exploration explored 100000 steps with 24751 reset in 656 ms.
Product exploration explored 100000 steps with 24713 reset in 687 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 293 ms :[p2, p2, (NOT p1), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), true, (AND p2 (NOT p0)), p2]
Support contains 4 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 453 transition count 421
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 453 transition count 421
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 453 transition count 421
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 437 transition count 405
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 437 transition count 405
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 87 place count 437 transition count 420
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 87 rules in 55 ms. Remains 437 /453 variables (removed 16) and now considering 420/421 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:29:04] [INFO ] Redundant transitions in 2 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 420 rows 437 cols
[2025-06-02 17:29:04] [INFO ] Computed 84 invariants in 1 ms
[2025-06-02 17:29:04] [INFO ] State equation strengthened by 171 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 8/92 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/92 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 420/857 variables, 437/529 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 171/700 constraints. Problems are: Problem set: 54 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 857/857 variables, and 700 constraints, problems are : Problem set: 54 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 437/437 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 40/437 variables, 84/84 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 8/92 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/92 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 420/857 variables, 437/529 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 171/700 constraints. Problems are: Problem set: 54 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 365/1065 constraints. Problems are: Problem set: 54 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 1065 constraints, problems are : Problem set: 54 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 437/437 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 365/419 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 54 solved, 365 unsolved
Search for dead transitions found 54 dead transitions in 60086ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 437/453 places, 366/421 transitions.
Graph (complete) has 1088 edges and 437 vertex of which 398 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.2 ms
Discarding 39 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 398 /437 variables (removed 39) and now considering 366/366 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 398/453 places, 366/421 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60166 ms. Remains : 398/453 places, 366/421 transitions.
Built C files in :
/tmp/ltsmin5350819918296914508
[2025-06-02 17:30:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5350819918296914508
Running compilation step : cd /tmp/ltsmin5350819918296914508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 649 ms.
Running link step : cd /tmp/ltsmin5350819918296914508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5350819918296914508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7060765993503461977.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 13 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:30:19] [INFO ] Computed 84 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:19] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-02 17:30:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:30:21] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2025-06-02 17:30:21] [INFO ] Invariant cache hit.
[2025-06-02 17:30:21] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:29] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:29] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:29] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 61664 ms. Remains : 453/453 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin8906903029629475763
[2025-06-02 17:31:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8906903029629475763
Running compilation step : cd /tmp/ltsmin8906903029629475763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 640 ms.
Running link step : cd /tmp/ltsmin8906903029629475763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8906903029629475763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9505397326438093595.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:31:36] [INFO ] Flatten gal took : 36 ms
[2025-06-02 17:31:36] [INFO ] Flatten gal took : 25 ms
[2025-06-02 17:31:36] [INFO ] Time to serialize gal into /tmp/LTL17464981793159850095.gal : 17 ms
[2025-06-02 17:31:36] [INFO ] Time to serialize properties into /tmp/LTL8561409109810764384.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17464981793159850095.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15126777985740520594.hoa' '-atoms' '/tmp/LTL8561409109810764384.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8561409109810764384.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15126777985740520594.hoa
Detected timeout of ITS tools.
[2025-06-02 17:31:51] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:31:51] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:31:51] [INFO ] Time to serialize gal into /tmp/LTL9743209905081600632.gal : 3 ms
[2025-06-02 17:31:51] [INFO ] Time to serialize properties into /tmp/LTL12376625507594158994.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9743209905081600632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12376625507594158994.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((!(X(!((X("(p22==1)"))U("(p28==1)")))))U(G(!("((p30==1)&&(p67==1))"))))))
Formula 0 simplified : X(X(!"(p28==1)" & X(!"(p28==1)" W !"(p22==1)")) R F"((p30==1)&&(p67==1))")
Detected timeout of ITS tools.
[2025-06-02 17:32:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:32:06] [INFO ] Applying decomposition
[2025-06-02 17:32:06] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16785676461949998286.txt' '-o' '/tmp/graph16785676461949998286.bin' '-w' '/tmp/graph16785676461949998286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16785676461949998286.bin' '-l' '-1' '-v' '-w' '/tmp/graph16785676461949998286.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:32:06] [INFO ] Decomposing Gal with order
[2025-06-02 17:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:32:06] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-02 17:32:06] [INFO ] Flatten gal took : 63 ms
[2025-06-02 17:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-02 17:32:06] [INFO ] Time to serialize gal into /tmp/LTL17986982227230181975.gal : 8 ms
[2025-06-02 17:32:06] [INFO ] Time to serialize properties into /tmp/LTL11086779892958805464.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17986982227230181975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11086779892958805464.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((!(X(!((X("(i11.i0.u10.p22==1)"))U("(i0.i0.u13.p28==1)")))))U(G(!("((i3.i4.u14.p30==1)&&(i3.i4.u29.p67==1))"))))))
Formula 0 simplified : X(X(!"(i0.i0.u13.p28==1)" & X(!"(i0.i0.u13.p28==1)" W !"(i11.i0.u10.p22==1)")) R F"((i3.i4.u14.p30==1)&&(i3.i4.u29.p67==1))")
Reverse transition relation is NOT exact ! Due to transitions i3.i4.u45.t104, i5.i0.u81.t70, i8.i2.u117.t36, i13.u154.t2, Intersection with reachable at e...221
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
397 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,4.04829,206380,1,0,377143,8220,6991,838182,810,38013,604885
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-05 finished in 258819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((G(p2)&&p1)))))))'
Support contains 6 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 16 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:32:12] [INFO ] Computed 87 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:12] [INFO ] Implicit Places using invariants in 298 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 325 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 11 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:32:12] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:12] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-02 17:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:13] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:32:14] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2073 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 2269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 459 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 443 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 443 transition count 392
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 427 transition count 392
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 424 transition count 389
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 424 transition count 389
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 402 transition count 367
Applied a total of 114 rules in 54 ms. Remains 402 /460 variables (removed 58) and now considering 367/425 (removed 58) transitions.
// Phase 1: matrix 367 rows 402 cols
[2025-06-02 17:32:14] [INFO ] Computed 87 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:14] [INFO ] Implicit Places using invariants in 238 ms returned [81, 118, 213]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 239 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/460 places, 367/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 398 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 398 transition count 366
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 0 with 4 rules applied. Total rules applied 6 place count 396 transition count 364
Applied a total of 6 rules in 26 ms. Remains 396 /399 variables (removed 3) and now considering 364/367 (removed 3) transitions.
// Phase 1: matrix 364 rows 396 cols
[2025-06-02 17:32:14] [INFO ] Computed 84 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:14] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-06-02 17:32:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:15] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/460 places, 364/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 928 ms. Remains : 396/460 places, 364/425 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-07
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-07 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((p0&&(p1 U p2))) U p3) U (G(p0) U p4)))'
Support contains 5 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 460 transition count 409
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 444 transition count 409
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 444 transition count 393
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 428 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 426 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 426 transition count 391
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 112 place count 404 transition count 369
Applied a total of 112 rules in 33 ms. Remains 404 /460 variables (removed 56) and now considering 369/425 (removed 56) transitions.
// Phase 1: matrix 369 rows 404 cols
[2025-06-02 17:32:15] [INFO ] Computed 87 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:15] [INFO ] Implicit Places using invariants in 275 ms returned [82, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 276 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/460 places, 369/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 401 transition count 368
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 401 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 400 transition count 367
Applied a total of 4 rules in 30 ms. Remains 400 /402 variables (removed 2) and now considering 367/369 (removed 2) transitions.
// Phase 1: matrix 367 rows 400 cols
[2025-06-02 17:32:15] [INFO ] Computed 85 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:16] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-06-02 17:32:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:16] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-02 17:32:16] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 400/460 places, 367/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1442 ms. Remains : 400/460 places, 367/425 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p4), (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1 (NOT p2) (NOT p4)) (AND (NOT p2) p3 (NOT p4))), (NOT p2)]
Running random walk in product with property : Parking-PT-432-LTLFireability-08
Stuttering criterion allowed to conclude after 104 steps with 3 reset in 2 ms.
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-08 finished in 1849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G((F(p1) U p2)) U X(G(!p3)))))'
Support contains 5 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 18 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:32:17] [INFO ] Computed 87 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:17] [INFO ] Implicit Places using invariants in 204 ms returned [131, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 221 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/460 places, 422/425 transitions.
Applied a total of 0 rules in 5 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 455/460 places, 422/425 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) p3), (NOT p0), (AND (NOT p1) p2 p3), p3, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-09
Stuttering criterion allowed to conclude after 105 steps with 2 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-09 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||G(!p1))) U X(p2))&&X((p3 U p2))))'
Support contains 6 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 14 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
[2025-06-02 17:32:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:17] [INFO ] Implicit Places using invariants in 222 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 225 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 19 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:32:18] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:18] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-06-02 17:32:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:18] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:32:19] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1783 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p2) (AND (NOT p0) p1)), p1, (AND p1 (NOT p0)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-10 finished in 2144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||G(p1)))||((!p0||G(p1))&&X(F(p2))))))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 423
Applied a total of 4 rules in 12 ms. Remains 458 /460 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 458 cols
[2025-06-02 17:32:19] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:20] [INFO ] Implicit Places using invariants in 209 ms returned [90, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 210 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/460 places, 423/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 455 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 422
Applied a total of 2 rules in 20 ms. Remains 455 /456 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 455 cols
[2025-06-02 17:32:20] [INFO ] Computed 85 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:20] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-02 17:32:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:20] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:32:21] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/460 places, 422/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1838 ms. Remains : 455/460 places, 422/425 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (NOT p2), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-11
Product exploration explored 100000 steps with 909 reset in 414 ms.
Product exploration explored 100000 steps with 910 reset in 451 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 144 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40000 steps (364 resets) in 350 ms. (113 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 353 ms. (113 steps per ms) remains 2/2 properties
[2025-06-02 17:32:23] [INFO ] Invariant cache hit.
[2025-06-02 17:32:23] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/147 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/455 variables, 82/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/877 variables, 0/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 648 constraints, problems are : Problem set: 1 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 380/455 variables, 83/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/877 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (OR p1 p2))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 417 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2025-06-02 17:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:25] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 17:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:25] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:32:26] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2025-06-02 17:32:26] [INFO ] Invariant cache hit.
[2025-06-02 17:32:26] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:34] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:34] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:35] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:35] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/877 variables, and 652 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 421/1073 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/877 variables, and 1073 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 61748 ms. Remains : 455/455 places, 422/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (362 resets) in 218 ms. (182 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2025-06-02 17:33:27] [INFO ] Invariant cache hit.
[2025-06-02 17:33:27] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 380/455 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 380/455 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/877 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1115 steps, including 21 resets, run visited all 1 properties in 8 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 911 reset in 375 ms.
Product exploration explored 100000 steps with 913 reset in 413 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 455 transition count 422
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 14 place count 455 transition count 422
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 28 place count 455 transition count 422
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 441 transition count 408
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 441 transition count 408
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 79 place count 441 transition count 424
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 79 rules in 49 ms. Remains 441 /455 variables (removed 14) and now considering 424/422 (removed -2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:33:29] [INFO ] Redundant transitions in 22 ms returned []
Running 423 sub problems to find dead transitions.
// Phase 1: matrix 424 rows 441 cols
[2025-06-02 17:33:29] [INFO ] Computed 85 invariants in 3 ms
[2025-06-02 17:33:29] [INFO ] State equation strengthened by 170 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:37] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:38] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 8/93 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/93 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 424/865 variables, 441/534 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 170/704 constraints. Problems are: Problem set: 53 solved, 370 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 865/865 variables, and 704 constraints, problems are : Problem set: 53 solved, 370 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 441/441 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 38/441 variables, 85/85 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 8/93 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/93 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 424/865 variables, 441/534 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/865 variables, 170/704 constraints. Problems are: Problem set: 53 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 370/1074 constraints. Problems are: Problem set: 53 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 865/865 variables, and 1074 constraints, problems are : Problem set: 53 solved, 370 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 441/441 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 370/423 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 53 solved, 370 unsolved
Search for dead transitions found 53 dead transitions in 60096ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 441/455 places, 371/422 transitions.
Graph (complete) has 1096 edges and 441 vertex of which 404 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 404 /441 variables (removed 37) and now considering 371/371 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/455 places, 371/422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60183 ms. Remains : 404/455 places, 371/422 transitions.
Built C files in :
/tmp/ltsmin12352068574282551803
[2025-06-02 17:34:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12352068574282551803
Running compilation step : cd /tmp/ltsmin12352068574282551803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 616 ms.
Running link step : cd /tmp/ltsmin12352068574282551803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12352068574282551803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8343680589544753788.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2025-06-02 17:34:44] [INFO ] Computed 85 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:45] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 17:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:45] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:34:46] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2025-06-02 17:34:46] [INFO ] Invariant cache hit.
[2025-06-02 17:34:46] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:54] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:54] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:55] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:55] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/877 variables, and 652 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/877 variables, 455/544 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 108/652 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 421/1073 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/877 variables, and 1073 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 61750 ms. Remains : 455/455 places, 422/422 transitions.
Built C files in :
/tmp/ltsmin9937921137435879585
[2025-06-02 17:35:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9937921137435879585
Running compilation step : cd /tmp/ltsmin9937921137435879585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 677 ms.
Running link step : cd /tmp/ltsmin9937921137435879585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9937921137435879585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14007970055434811285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:36:01] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:36:01] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:36:01] [INFO ] Time to serialize gal into /tmp/LTL14707951797018106644.gal : 2 ms
[2025-06-02 17:36:01] [INFO ] Time to serialize properties into /tmp/LTL12518881588020189011.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14707951797018106644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut507735163630546377.hoa' '-atoms' '/tmp/LTL12518881588020189011.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12518881588020189011.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut507735163630546377.hoa
Detected timeout of ITS tools.
[2025-06-02 17:36:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:36:17] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:36:17] [INFO ] Time to serialize gal into /tmp/LTL4959807563839581475.gal : 2 ms
[2025-06-02 17:36:17] [INFO ] Time to serialize properties into /tmp/LTL4309400549384644399.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4959807563839581475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4309400549384644399.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("(p210!=1)")||(G("(p234!=1)"))))||((X(F("((p73==1)&&(p146==1))")))&&(("(p210!=1)")||(G("(p234!=1)")))))))
Formula 0 simplified : X(F(!"(p210!=1)" & F!"(p234!=1)") & ((!"(p210!=1)" & F!"(p234!=1)") | XG!"((p73==1)&&(p146==1))"))
Detected timeout of ITS tools.
[2025-06-02 17:36:32] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:36:32] [INFO ] Applying decomposition
[2025-06-02 17:36:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7025716421424469293.txt' '-o' '/tmp/graph7025716421424469293.bin' '-w' '/tmp/graph7025716421424469293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7025716421424469293.bin' '-l' '-1' '-v' '-w' '/tmp/graph7025716421424469293.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:36:32] [INFO ] Decomposing Gal with order
[2025-06-02 17:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:36:32] [INFO ] Removed a total of 58 redundant transitions.
[2025-06-02 17:36:32] [INFO ] Flatten gal took : 21 ms
[2025-06-02 17:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-02 17:36:32] [INFO ] Time to serialize gal into /tmp/LTL3834876985237438429.gal : 6 ms
[2025-06-02 17:36:32] [INFO ] Time to serialize properties into /tmp/LTL6399249981877728889.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3834876985237438429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6399249981877728889.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(("(i5.u69.p210!=1)")||(G("(i5.u72.p234!=1)"))))||((X(F("((i1.i1.i2.u31.p73==1)&&(i1.i1.i2.u46.p146==1))")))&&(("(i5.u69.p210!=...189
Formula 0 simplified : X(F(!"(i5.u69.p210!=1)" & F!"(i5.u72.p234!=1)") & ((!"(i5.u69.p210!=1)" & F!"(i5.u72.p234!=1)") | XG!"((i1.i1.i2.u31.p73==1)&&(i1.i1...175
Reverse transition relation is NOT exact ! Due to transitions i1.i1.i2.u47.t104, i5.u83.t70, i11.i1.i3.u119.t36, i13.u153.t2, Intersection with reachable ...225
Computing Next relation with stutter on 1.50062e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
479 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,4.85173,219264,1,0,379356,10631,7201,962592,901,44635,558238
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-11 finished in 258448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U p0))'
Support contains 3 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 12 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:36:38] [INFO ] Computed 87 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:38] [INFO ] Implicit Places using invariants in 231 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 237 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 12 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:36:38] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:38] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 17:36:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:38] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:36:40] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1790 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!X(F(p1)) U p2)&&G(p3))||p0))))'
Support contains 7 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 17 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:36:40] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:40] [INFO ] Implicit Places using invariants in 211 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 212 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 12 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:36:40] [INFO ] Computed 84 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:40] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-02 17:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:40] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:36:42] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1802 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 2 ms.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-13 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 422
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 422
Applied a total of 6 rules in 16 ms. Remains 457 /460 variables (removed 3) and now considering 422/425 (removed 3) transitions.
// Phase 1: matrix 422 rows 457 cols
[2025-06-02 17:36:42] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:42] [INFO ] Implicit Places using invariants in 214 ms returned [89, 131, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 216 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/460 places, 422/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 18 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2025-06-02 17:36:42] [INFO ] Computed 84 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:42] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-02 17:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:42] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 17:36:44] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1784 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 1949 ms.
All properties solved by simple procedures.
Total runtime 622083 ms.

BK_STOP 1748885804347

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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