Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812500412.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-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812500412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.8K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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 49K 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-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748881465223

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-208
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 16:24:26] [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 16:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:24:26] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-06-02 16:24:26] [INFO ] Transformed 137 places.
[2025-06-02 16:24:26] [INFO ] Transformed 201 transitions.
[2025-06-02 16:24:26] [INFO ] Found NUPN structural information;
[2025-06-02 16:24:26] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 45 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2025-06-02 16:24:26] [INFO ] Computed 34 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:27] [INFO ] Implicit Places using invariants in 227 ms returned [28, 36, 44, 52, 64, 66, 93, 101, 117, 129]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 256 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/117 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 7 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2025-06-02 16:24:27] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 16:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:27] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/137 places, 110/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 532 ms. Remains : 120/137 places, 110/117 transitions.
Support contains 38 out of 120 places after structural reductions.
[2025-06-02 16:24:27] [INFO ] Flatten gal took : 27 ms
[2025-06-02 16:24:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:24:27] [INFO ] Input system was already deterministic with 110 transitions.
Support contains 36 out of 120 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (1166 resets) in 1677 ms. (23 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (103 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (101 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (99 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
[2025-06-02 16:24:28] [INFO ] Invariant cache hit.
[2025-06-02 16:24:28] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/120 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 120/120 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/120 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 120/120 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 102
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 112 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 111 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 111 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 104 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 34 place count 103 transition count 113
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 52 place count 103 transition count 95
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 70 place count 85 transition count 95
Applied a total of 70 rules in 37 ms. Remains 85 /120 variables (removed 35) and now considering 95/110 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 85/120 places, 95/110 transitions.
RANDOM walk for 35332 steps (455 resets) in 376 ms. (93 steps per ms) remains 0/3 properties
FORMULA Parking-PT-208-LTLFireability-05 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' '!((F((p0&&X(p1))) U (X(p1)||p2)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 4 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:24:29] [INFO ] Computed 24 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:29] [INFO ] Implicit Places using invariants in 92 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 5 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:24:29] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 16:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:30] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-00
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-00 finished in 703 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))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 106
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 116 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 115 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 115 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 112 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 110 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 110 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 104 transition count 94
Applied a total of 30 rules in 14 ms. Remains 104 /120 variables (removed 16) and now considering 94/110 (removed 16) transitions.
// Phase 1: matrix 94 rows 104 cols
[2025-06-02 16:24:30] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:30] [INFO ] Implicit Places using invariants in 54 ms returned [85, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/120 places, 94/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 93
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 100 transition count 92
Applied a total of 4 rules in 8 ms. Remains 100 /102 variables (removed 2) and now considering 92/94 (removed 2) transitions.
// Phase 1: matrix 92 rows 100 cols
[2025-06-02 16:24:30] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 16:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/120 places, 92/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 100/120 places, 92/110 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-01
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-01 finished in 404 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(F(p0)))||((F(G(p1)) U p2) U p3)))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 109
Applied a total of 2 rules in 9 ms. Remains 119 /120 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 119 cols
[2025-06-02 16:24:30] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:30] [INFO ] Implicit Places using invariants in 136 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/120 places, 109/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 4 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2025-06-02 16:24:30] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 16:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:31] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/120 places, 108/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 117/120 places, 108/110 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Parking-PT-208-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 346 ms.
Product exploration explored 100000 steps with 33333 reset in 263 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/117 stabilizing places and 1/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) p0), (X (NOT (OR p3 p2))), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 16 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-02 finished in 1314 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((X(X(X((p1&&F(p2)))))||p0)))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 2 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:24:32] [INFO ] Computed 24 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants in 66 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:24:32] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 16:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 193 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-208-LTLFireability-03
Entered a terminal (fully accepting) state of product in 9858 steps with 288 reset in 39 ms.
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-03 finished in 490 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 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 115 transition count 101
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 111 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 109 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 109 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 103 transition count 93
Applied a total of 32 rules in 13 ms. Remains 103 /120 variables (removed 17) and now considering 93/110 (removed 17) transitions.
// Phase 1: matrix 93 rows 103 cols
[2025-06-02 16:24:32] [INFO ] Computed 24 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants in 54 ms returned [84, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/120 places, 93/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 92
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 99 transition count 91
Applied a total of 4 rules in 9 ms. Remains 99 /101 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 99 cols
[2025-06-02 16:24:32] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 16:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/120 places, 91/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 99/120 places, 91/110 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-04
Product exploration explored 100000 steps with 3060 reset in 179 ms.
Product exploration explored 100000 steps with 3061 reset in 209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 837 steps (22 resets) in 7 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-02 16:24:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 16:24:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:24:33] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-02 16:24:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 91/190 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 121 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 91/190 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 61/182 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 182 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3381ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3534 ms. Remains : 99/99 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 427 steps (10 resets) in 7 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3070 reset in 150 ms.
Product exploration explored 100000 steps with 3063 reset in 283 ms.
Built C files in :
/tmp/ltsmin15835512845160935482
[2025-06-02 16:24:37] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-06-02 16:24:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:24:37] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-06-02 16:24:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:24:37] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-06-02 16:24:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:24:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15835512845160935482
Running compilation step : cd /tmp/ltsmin15835512845160935482;'/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 301 ms.
Running link step : cd /tmp/ltsmin15835512845160935482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15835512845160935482;'/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/stateBased17329761525022070805.hoa' '--buchi-type=spotba'
LTSmin run took 159 ms.
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-04 finished in 5970 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 X(p0))||F((p1||(F(p0)&&p2)))))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 112 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 111 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 111 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 105 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 32 place count 104 transition count 114
Applied a total of 32 rules in 21 ms. Remains 104 /120 variables (removed 16) and now considering 114/110 (removed -4) transitions.
// Phase 1: matrix 114 rows 104 cols
[2025-06-02 16:24:38] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:38] [INFO ] Implicit Places using invariants in 57 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/120 places, 114/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 113
Applied a total of 2 rules in 5 ms. Remains 102 /103 variables (removed 1) and now considering 113/114 (removed 1) transitions.
// Phase 1: matrix 113 rows 102 cols
[2025-06-02 16:24:38] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 16:24:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 16:24:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/120 places, 113/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 102/120 places, 113/110 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-LTLFireability-06
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-06 finished in 429 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))&&(X(p1)||F(p2))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 3 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:24:38] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants in 59 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:24:39] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 16:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLFireability-07
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-07 finished in 419 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) U (p1||X((p2 U p3)))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 3 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:24:39] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants in 65 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:24:39] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 16:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-08 finished in 481 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 ((G(!p1)&&X(X(!p0))&&(p0||(p0 U p2)))||X(X(G(!p0)))))))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 3 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:24:39] [INFO ] Computed 24 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:39] [INFO ] Implicit Places using invariants in 66 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/120 places, 108/110 transitions.
Applied a total of 0 rules in 0 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 117/120 places, 108/110 transitions.
Stuttering acceptance computed with spot in 320 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p1 p0), (AND p1 (NOT p0))]
Running random walk in product with property : Parking-PT-208-LTLFireability-09
Product exploration explored 100000 steps with 19985 reset in 272 ms.
Product exploration explored 100000 steps with 20008 reset in 285 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 p1) (NOT p0) (NOT p2)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 14 factoid took 369 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (1165 resets) in 205 ms. (194 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (100 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
// Phase 1: matrix 108 rows 117 cols
[2025-06-02 16:24:41] [INFO ] Computed 23 invariants in 1 ms
[2025-06-02 16:24:41] [INFO ] State equation strengthened by 26 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, 3 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/42 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 75/117 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 108/225 variables, 117/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 26/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 166 constraints, problems are : Problem set: 1 solved, 2 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
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: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/117 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 108/225 variables, 117/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 26/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 2/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 168 constraints, problems are : Problem set: 1 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 108/108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 113 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 113 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 109 transition count 100
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 100 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 36 place count 99 transition count 110
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 99 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (complete) has 197 edges and 77 vertex of which 40 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Iterating post reduction 2 with 23 rules applied. Total rules applied 81 place count 40 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 91 place count 40 transition count 34
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 40 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 39 transition count 33
Applied a total of 93 rules in 15 ms. Remains 39 /117 variables (removed 78) and now considering 33/108 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 39/117 places, 33/108 transitions.
RANDOM walk for 23890 steps (1505 resets) in 91 ms. (259 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 612 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 407 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-02 16:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 16:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:24:43] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-02 16:24:43] [INFO ] Invariant cache hit.
[2025-06-02 16:24:43] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:44] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:44] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 168 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3971 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 107/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9039ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 9041ms
Finished structural reductions in LTL mode , in 1 iterations and 9212 ms. Remains : 117/117 places, 108/108 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 p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
RANDOM walk for 40000 steps (1161 resets) in 86 ms. (459 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (102 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2025-06-02 16:24:53] [INFO ] Invariant cache hit.
[2025-06-02 16:24:53] [INFO ] State equation strengthened by 26 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) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/117 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/225 variables, 117/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 26/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 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) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/117 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/225 variables, 117/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 26/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 108/108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 113 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 113 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 109 transition count 100
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 100 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 36 place count 99 transition count 110
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 59 place count 99 transition count 87
Reduce places removed 23 places and 0 transitions.
Graph (complete) has 194 edges and 76 vertex of which 39 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Iterating post reduction 2 with 24 rules applied. Total rules applied 83 place count 39 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 93 place count 39 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 39 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 38 transition count 32
Applied a total of 95 rules in 11 ms. Remains 38 /117 variables (removed 79) and now considering 32/108 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 38/117 places, 32/108 transitions.
RANDOM walk for 38938 steps (1396 resets) in 65 ms. (589 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F p0), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) p1)))]
Knowledge based reduction with 9 factoid took 545 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 354 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 390 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Product exploration explored 100000 steps with 19997 reset in 221 ms.
Product exploration explored 100000 steps with 19981 reset in 235 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 361 ms :[p0, p0, p0, (AND p0 p1), p0, (AND p0 p1), true, (AND p0 p1), p1]
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 117 transition count 108
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 113 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 113 transition count 104
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 113 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 23 rules in 25 ms. Remains 113 /117 variables (removed 4) and now considering 108/108 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:24:56] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 113 cols
[2025-06-02 16:24:56] [INFO ] Computed 23 invariants in 2 ms
[2025-06-02 16:24:56] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:57] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:57] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 108/221 variables, 113/140 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 42/182 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 182 constraints, problems are : Problem set: 15 solved, 92 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 113/113 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 12/113 variables, 23/23 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 108/221 variables, 113/140 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 42/182 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 92/274 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 274 constraints, problems are : Problem set: 15 solved, 92 unsolved in 4268 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 113/113 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 92/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8064ms problems are : Problem set: 15 solved, 92 unsolved
Search for dead transitions found 15 dead transitions in 8065ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/117 places, 93/108 transitions.
Graph (complete) has 273 edges and 113 vertex of which 102 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 11 ms. Remains 102 /113 variables (removed 11) and now considering 117/93 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/117 places, 117/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8111 ms. Remains : 102/117 places, 117/108 transitions.
Built C files in :
/tmp/ltsmin4817104370396104929
[2025-06-02 16:25:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4817104370396104929
Running compilation step : cd /tmp/ltsmin4817104370396104929;'/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 194 ms.
Running link step : cd /tmp/ltsmin4817104370396104929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4817104370396104929;'/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/stateBased5448443375203534049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2025-06-02 16:25:19] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 16:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:25:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-02 16:25:20] [INFO ] Invariant cache hit.
[2025-06-02 16:25:20] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:20] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:20] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 168 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 107/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5302 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9090ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 9091ms
Finished structural reductions in LTL mode , in 1 iterations and 9275 ms. Remains : 117/117 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin3209409043890821121
[2025-06-02 16:25:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3209409043890821121
Running compilation step : cd /tmp/ltsmin3209409043890821121;'/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 207 ms.
Running link step : cd /tmp/ltsmin3209409043890821121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3209409043890821121;'/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/stateBased9138192610313005462.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 16:25:44] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:25:44] [INFO ] Flatten gal took : 7 ms
[2025-06-02 16:25:44] [INFO ] Time to serialize gal into /tmp/LTL1296178928457568721.gal : 3 ms
[2025-06-02 16:25:44] [INFO ] Time to serialize properties into /tmp/LTL4357164041954540436.prop : 1 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/LTL1296178928457568721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5459357434614047668.hoa' '-atoms' '/tmp/LTL4357164041954540436.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...317
Loading property file /tmp/LTL4357164041954540436.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5459357434614047668.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Computing Next relation with stutter on 289 deadlock states
13 unique states visited
9 strongly connected components in search stack
14 transitions explored
9 items max in DFS search stack
155 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,1.58962,80340,1,0,379,314230,273,298,3609,384160,657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-208-LTLFireability-09 finished in 66364 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((X(p1)||p0)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 8 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:25:46] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants in 69 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 4 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:25:46] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 16:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-10
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-10 finished in 356 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(X(p0))))&&((X(p1) U p2) U X(X(p3)))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 108
Applied a total of 4 rules in 5 ms. Remains 118 /120 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 118 cols
[2025-06-02 16:25:46] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants in 69 ms returned [96, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/120 places, 108/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 1 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 16:25:46] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 16:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 16:25:46] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/120 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 230 ms. Remains : 115/120 places, 107/110 transitions.
Stuttering acceptance computed with spot in 518 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p0), (NOT p0), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-208-LTLFireability-11
Entered a terminal (fully accepting) state of product in 16 steps with 4 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-11 finished in 771 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)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 112 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 110 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 110 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 103 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 36 place count 102 transition count 112
Applied a total of 36 rules in 14 ms. Remains 102 /120 variables (removed 18) and now considering 112/110 (removed -2) transitions.
// Phase 1: matrix 112 rows 102 cols
[2025-06-02 16:25:47] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants in 62 ms returned [83, 99]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/120 places, 112/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 111
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 98 transition count 110
Applied a total of 4 rules in 4 ms. Remains 98 /100 variables (removed 2) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 98 cols
[2025-06-02 16:25:47] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 16:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/120 places, 110/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 98/120 places, 110/110 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 347 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 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 116 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 112 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 110 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 110 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 103 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 36 place count 102 transition count 112
Applied a total of 36 rules in 13 ms. Remains 102 /120 variables (removed 18) and now considering 112/110 (removed -2) transitions.
// Phase 1: matrix 112 rows 102 cols
[2025-06-02 16:25:47] [INFO ] Computed 24 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants in 62 ms returned [83, 99]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/120 places, 112/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 111
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 98 transition count 110
Applied a total of 4 rules in 5 ms. Remains 98 /100 variables (removed 2) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 98 cols
[2025-06-02 16:25:47] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 16:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 16:25:47] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/120 places, 110/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 98/120 places, 110/110 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-13 finished in 969 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(F(p1))&&p0)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 120 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 117 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 117 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 114 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 112 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 112 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 106 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 30 place count 105 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 105 transition count 115
Applied a total of 31 rules in 15 ms. Remains 105 /120 variables (removed 15) and now considering 115/110 (removed -5) transitions.
// Phase 1: matrix 115 rows 105 cols
[2025-06-02 16:25:48] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:48] [INFO ] Implicit Places using invariants in 61 ms returned [86, 102]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/120 places, 115/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 114
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 101 transition count 113
Applied a total of 4 rules in 4 ms. Remains 101 /103 variables (removed 2) and now considering 113/115 (removed 2) transitions.
// Phase 1: matrix 113 rows 101 cols
[2025-06-02 16:25:48] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 16:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 16:25:48] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/120 places, 113/110 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 101/120 places, 113/110 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-14 finished in 411 ms.
All properties solved by simple procedures.
Total runtime 82624 ms.

BK_STOP 1748881549136

--------------------
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-208"
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-208, 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-174876812500412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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