Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654406900075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Parking-PT-416, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 107K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-416-LTLCardinality-00
FORMULA_NAME Parking-PT-416-LTLCardinality-01
FORMULA_NAME Parking-PT-416-LTLCardinality-02
FORMULA_NAME Parking-PT-416-LTLCardinality-03
FORMULA_NAME Parking-PT-416-LTLCardinality-04
FORMULA_NAME Parking-PT-416-LTLCardinality-05
FORMULA_NAME Parking-PT-416-LTLCardinality-06
FORMULA_NAME Parking-PT-416-LTLCardinality-07
FORMULA_NAME Parking-PT-416-LTLCardinality-08
FORMULA_NAME Parking-PT-416-LTLCardinality-09
FORMULA_NAME Parking-PT-416-LTLCardinality-10
FORMULA_NAME Parking-PT-416-LTLCardinality-11
FORMULA_NAME Parking-PT-416-LTLCardinality-12
FORMULA_NAME Parking-PT-416-LTLCardinality-13
FORMULA_NAME Parking-PT-416-LTLCardinality-14
FORMULA_NAME Parking-PT-416-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717245091932

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:31:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:31:34] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-01 12:31:34] [INFO ] Transformed 305 places.
[2024-06-01 12:31:34] [INFO ] Transformed 433 transitions.
[2024-06-01 12:31:34] [INFO ] Found NUPN structural information;
[2024-06-01 12:31:34] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 124 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2024-06-01 12:31:35] [INFO ] Computed 76 invariants in 41 ms
[2024-06-01 12:31:36] [INFO ] Implicit Places using invariants in 896 ms returned [48, 56, 64, 118, 126, 134, 142, 160, 195, 203, 211, 227, 229, 256, 264, 272, 280, 296, 298]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 970 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/305 places, 255/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 273 transition count 244
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 273 transition count 244
Applied a total of 22 rules in 31 ms. Remains 273 /284 variables (removed 11) and now considering 244/255 (removed 11) transitions.
// Phase 1: matrix 244 rows 273 cols
[2024-06-01 12:31:36] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 12:31:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 12:31:36] [INFO ] Invariant cache hit.
[2024-06-01 12:31:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:31:37] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 273/305 places, 244/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2242 ms. Remains : 273/305 places, 244/257 transitions.
Support contains 30 out of 273 places after structural reductions.
[2024-06-01 12:31:37] [INFO ] Flatten gal took : 109 ms
[2024-06-01 12:31:37] [INFO ] Flatten gal took : 50 ms
[2024-06-01 12:31:38] [INFO ] Input system was already deterministic with 244 transitions.
RANDOM walk for 40000 steps (512 resets) in 2503 ms. (15 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (20 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 328 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
[2024-06-01 12:31:39] [INFO ] Invariant cache hit.
[2024-06-01 12:31:39] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/273 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 244/517 variables, 273/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 60/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 390 constraints, problems are : Problem set: 0 solved, 4 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 273/273 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/273 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 244/517 variables, 273/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 60/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/517 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 394 constraints, problems are : Problem set: 0 solved, 4 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 273/273 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1617ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1315 ms.
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 273 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 265 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 265 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 257 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 254 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 254 transition count 225
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 70 place count 238 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 237 transition count 228
Free-agglomeration rule applied 54 times.
Iterating global reduction 2 with 54 rules applied. Total rules applied 126 place count 237 transition count 174
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 180 place count 183 transition count 174
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 183 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 182 transition count 173
Applied a total of 182 rules in 143 ms. Remains 182 /273 variables (removed 91) and now considering 173/244 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 182/273 places, 173/244 transitions.
RANDOM walk for 40000 steps (8 resets) in 1308 ms. (30 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
// Phase 1: matrix 173 rows 182 cols
[2024-06-01 12:31:42] [INFO ] Computed 57 invariants in 7 ms
[2024-06-01 12:31:42] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/182 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/355 variables, 182/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 154/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 182/182 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/109 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/182 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/355 variables, 182/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 154/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 395 constraints, problems are : Problem set: 0 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 182/182 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 112 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 17 ms.
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 17 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-06-01 12:31:43] [INFO ] Computed 57 invariants in 3 ms
[2024-06-01 12:31:44] [INFO ] Implicit Places using invariants in 260 ms returned [67, 85, 145, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 261 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/273 places, 241/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 11 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-06-01 12:31:44] [INFO ] Computed 53 invariants in 4 ms
[2024-06-01 12:31:44] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-01 12:31:44] [INFO ] Invariant cache hit.
[2024-06-01 12:31:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:31:44] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/273 places, 238/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1082 ms. Remains : 263/273 places, 238/244 transitions.
Stuttering acceptance computed with spot in 441 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Parking-PT-416-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-00 finished in 1633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 271 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 271 transition count 242
Applied a total of 4 rules in 25 ms. Remains 271 /273 variables (removed 2) and now considering 242/244 (removed 2) transitions.
// Phase 1: matrix 242 rows 271 cols
[2024-06-01 12:31:45] [INFO ] Computed 57 invariants in 3 ms
[2024-06-01 12:31:45] [INFO ] Implicit Places using invariants in 297 ms returned [67, 83, 85, 174]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 298 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 267/273 places, 242/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 239
Applied a total of 6 rules in 20 ms. Remains 264 /267 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 264 cols
[2024-06-01 12:31:45] [INFO ] Computed 53 invariants in 3 ms
[2024-06-01 12:31:45] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-01 12:31:45] [INFO ] Invariant cache hit.
[2024-06-01 12:31:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:31:46] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/273 places, 239/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1276 ms. Remains : 264/273 places, 239/244 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-02 finished in 1507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 253 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 253 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 236 transition count 207
Applied a total of 72 rules in 60 ms. Remains 236 /273 variables (removed 37) and now considering 207/244 (removed 37) transitions.
// Phase 1: matrix 207 rows 236 cols
[2024-06-01 12:31:46] [INFO ] Computed 57 invariants in 3 ms
[2024-06-01 12:31:47] [INFO ] Implicit Places using invariants in 260 ms returned [60, 76, 78, 129, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 263 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 207/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 205
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 6 place count 228 transition count 204
Applied a total of 6 rules in 26 ms. Remains 228 /231 variables (removed 3) and now considering 204/207 (removed 3) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-06-01 12:31:47] [INFO ] Computed 52 invariants in 3 ms
[2024-06-01 12:31:47] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 12:31:47] [INFO ] Invariant cache hit.
[2024-06-01 12:31:47] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 204/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 993 ms. Remains : 228/273 places, 204/244 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-06
Product exploration explored 100000 steps with 1315 reset in 708 ms.
Product exploration explored 100000 steps with 1329 reset in 759 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 141 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 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (531 resets) in 586 ms. (68 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 970120 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970120 steps, saw 124282 distinct states, run finished after 3005 ms. (steps per millisecond=322 ) properties seen :0
[2024-06-01 12:31:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/72 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/108 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/432 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 13/52 constraints, State Equation: 57/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/72 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/108 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/112 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/116 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/124 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/186 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 84/270 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/270 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/324 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/324 variables, 18/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/324 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/324 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/432 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 39/52 constraints, State Equation: 171/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 15 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 12:31:53] [INFO ] Invariant cache hit.
[2024-06-01 12:31:53] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 12:31:53] [INFO ] Invariant cache hit.
[2024-06-01 12:31:54] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-06-01 12:31:54] [INFO ] Redundant transitions in 12 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 12:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8457 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 9363 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 17887ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 17893ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18685 ms. Remains : 228/228 places, 204/204 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 121 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 74 ms :[(NOT p0)]
RANDOM walk for 40000 steps (524 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 978016 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 978016 steps, saw 125485 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
[2024-06-01 12:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/72 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/108 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/432 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 13/52 constraints, State Equation: 57/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/72 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/108 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/112 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/116 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/124 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/186 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 84/270 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/270 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/324 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/324 variables, 18/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/324 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/324 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/432 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 39/52 constraints, State Equation: 171/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 206 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1321 reset in 311 ms.
Product exploration explored 100000 steps with 1318 reset in 340 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 12:32:16] [INFO ] Invariant cache hit.
[2024-06-01 12:32:17] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 12:32:17] [INFO ] Invariant cache hit.
[2024-06-01 12:32:17] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-06-01 12:32:17] [INFO ] Redundant transitions in 14 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 12:32:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8939 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8396 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 17371ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 17375ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18022 ms. Remains : 228/228 places, 204/204 transitions.
Treatment of property Parking-PT-416-LTLCardinality-06 finished in 48128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 6 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-06-01 12:32:34] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 12:32:35] [INFO ] Implicit Places using invariants in 194 ms returned [67, 83, 85, 145, 173]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 195 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/273 places, 241/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 261 transition count 237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 261 transition count 237
Applied a total of 8 rules in 4 ms. Remains 261 /265 variables (removed 4) and now considering 237/241 (removed 4) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:32:35] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:32:35] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-01 12:32:35] [INFO ] Invariant cache hit.
[2024-06-01 12:32:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:32:35] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/273 places, 237/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 950 ms. Remains : 261/273 places, 237/244 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-07
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 3 ms.
FORMULA Parking-PT-416-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-07 finished in 1142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 271 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 271 transition count 242
Applied a total of 4 rules in 5 ms. Remains 271 /273 variables (removed 2) and now considering 242/244 (removed 2) transitions.
// Phase 1: matrix 242 rows 271 cols
[2024-06-01 12:32:36] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 12:32:36] [INFO ] Implicit Places using invariants in 313 ms returned [67, 83, 85, 145]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 314 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 267/273 places, 242/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 239
Applied a total of 6 rules in 8 ms. Remains 264 /267 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 264 cols
[2024-06-01 12:32:36] [INFO ] Computed 53 invariants in 3 ms
[2024-06-01 12:32:36] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 12:32:36] [INFO ] Invariant cache hit.
[2024-06-01 12:32:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:32:37] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/273 places, 239/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1296 ms. Remains : 264/273 places, 239/244 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 1146 ms.
Product exploration explored 100000 steps with 50000 reset in 917 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLCardinality-08 finished in 3600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 273 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 265 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 265 transition count 228
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 257 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 254 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 254 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 237 transition count 208
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 74 place count 236 transition count 227
Applied a total of 74 rules in 31 ms. Remains 236 /273 variables (removed 37) and now considering 227/244 (removed 17) transitions.
// Phase 1: matrix 227 rows 236 cols
[2024-06-01 12:32:39] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 12:32:39] [INFO ] Implicit Places using invariants in 203 ms returned [61, 77, 79, 130, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 204 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 227/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 225
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 6 place count 228 transition count 224
Applied a total of 6 rules in 15 ms. Remains 228 /231 variables (removed 3) and now considering 224/227 (removed 3) transitions.
// Phase 1: matrix 224 rows 228 cols
[2024-06-01 12:32:39] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:32:40] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 12:32:40] [INFO ] Invariant cache hit.
[2024-06-01 12:32:40] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 12:32:40] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 224/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1180 ms. Remains : 228/273 places, 224/244 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-10
Product exploration explored 100000 steps with 1321 reset in 537 ms.
Product exploration explored 100000 steps with 1317 reset in 399 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (527 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 908950 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 1
Probabilistic random walk after 908950 steps, saw 115873 distinct states, run finished after 3001 ms. (steps per millisecond=302 ) properties seen :0
[2024-06-01 12:32:45] [INFO ] Invariant cache hit.
[2024-06-01 12:32:45] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
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) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/228 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/228 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 224/224 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 228 transition count 162
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 371 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 116 output transitions
Drop transitions (Output transitions of discarded places.) removed 116 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 45 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 135 place count 45 transition count 36
Applied a total of 135 rules in 34 ms. Remains 45 /228 variables (removed 183) and now considering 36/224 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 45/228 places, 36/224 transitions.
RANDOM walk for 30309 steps (1050 resets) in 68 ms. (439 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 140 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 192 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 224/224 transitions.
Applied a total of 0 rules in 14 ms. Remains 228 /228 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-01 12:32:46] [INFO ] Invariant cache hit.
[2024-06-01 12:32:46] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 12:32:46] [INFO ] Invariant cache hit.
[2024-06-01 12:32:46] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 12:32:47] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2024-06-01 12:32:47] [INFO ] Redundant transitions in 5 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 12:32:47] [INFO ] Invariant cache hit.
[2024-06-01 12:32:47] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 384 constraints, problems are : Problem set: 0 solved, 219 unsolved in 19500 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 219/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 603 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20832 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 40464ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 40470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41502 ms. Remains : 228/228 places, 224/224 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 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 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (528 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 914302 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 1
Probabilistic random walk after 914302 steps, saw 116608 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
[2024-06-01 12:33:30] [INFO ] Invariant cache hit.
[2024-06-01 12:33:30] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
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) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/228 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/228 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 224/224 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 228 transition count 162
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 371 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 116 output transitions
Drop transitions (Output transitions of discarded places.) removed 116 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 45 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 135 place count 45 transition count 36
Applied a total of 135 rules in 22 ms. Remains 45 /228 variables (removed 183) and now considering 36/224 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 45/228 places, 36/224 transitions.
RANDOM walk for 38217 steps (1405 resets) in 113 ms. (335 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 144 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1321 reset in 539 ms.
Product exploration explored 100000 steps with 1321 reset in 424 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-01 12:33:32] [INFO ] Invariant cache hit.
[2024-06-01 12:33:33] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 12:33:33] [INFO ] Invariant cache hit.
[2024-06-01 12:33:33] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 12:33:33] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-06-01 12:33:33] [INFO ] Redundant transitions in 3 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 12:33:33] [INFO ] Invariant cache hit.
[2024-06-01 12:33:33] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 384 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20178 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 224/452 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 104/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 219/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 603 constraints, problems are : Problem set: 0 solved, 219 unsolved in 19598 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 39856ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 39860ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40580 ms. Remains : 228/228 places, 224/224 transitions.
Treatment of property Parking-PT-416-LTLCardinality-10 finished in 93863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 254 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 254 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 237 transition count 208
Applied a total of 70 rules in 24 ms. Remains 237 /273 variables (removed 36) and now considering 208/244 (removed 36) transitions.
// Phase 1: matrix 208 rows 237 cols
[2024-06-01 12:34:13] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 12:34:13] [INFO ] Implicit Places using invariants in 223 ms returned [60, 76, 129, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 224 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/273 places, 208/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 231 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 231 transition count 206
Applied a total of 4 rules in 10 ms. Remains 231 /233 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 231 cols
[2024-06-01 12:34:13] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 12:34:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:34:13] [INFO ] Invariant cache hit.
[2024-06-01 12:34:14] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/273 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 745 ms. Remains : 231/273 places, 206/244 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-12
Product exploration explored 100000 steps with 6010 reset in 607 ms.
Product exploration explored 100000 steps with 5990 reset in 629 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 : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (528 resets) in 249 ms. (160 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2024-06-01 12:34:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/160 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/191 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/218 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/437 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/191 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/218 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/437 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 12:34:16] [INFO ] Invariant cache hit.
[2024-06-01 12:34:17] [INFO ] [Real]Absence check using 53 positive place invariants in 24 ms returned sat
[2024-06-01 12:34:17] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-06-01 12:34:17] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 25 ms.
[2024-06-01 12:34:17] [INFO ] Added : 30 causal constraints over 6 iterations in 300 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 206/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 12:34:17] [INFO ] Invariant cache hit.
[2024-06-01 12:34:18] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-06-01 12:34:18] [INFO ] Invariant cache hit.
[2024-06-01 12:34:18] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-06-01 12:34:18] [INFO ] Redundant transitions in 4 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 12:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 12:34:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 285 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10281 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 138/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 423 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9943 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints]
After SMT, in 20256ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 20262ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21008 ms. Remains : 231/231 places, 206/206 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 : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (527 resets) in 159 ms. (250 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-06-01 12:34:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/160 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/191 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/218 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/437 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/81 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/135 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/160 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/191 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/218 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 9/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/437 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 26/53 constraints, State Equation: 115/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 315 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 12:34:40] [INFO ] Invariant cache hit.
[2024-06-01 12:34:40] [INFO ] [Real]Absence check using 53 positive place invariants in 26 ms returned sat
[2024-06-01 12:34:40] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 12:34:40] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 28 ms.
[2024-06-01 12:34:40] [INFO ] Added : 30 causal constraints over 6 iterations in 231 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6101 reset in 803 ms.
Product exploration explored 100000 steps with 6013 reset in 464 ms.
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 206/206 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 12:34:42] [INFO ] Invariant cache hit.
[2024-06-01 12:34:42] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 12:34:42] [INFO ] Invariant cache hit.
[2024-06-01 12:34:42] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-01 12:34:42] [INFO ] Redundant transitions in 0 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 12:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 12:34:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 285 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10289 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/231 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 231/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 138/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 423 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9955 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints]
After SMT, in 20286ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 20291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20878 ms. Remains : 231/231 places, 206/206 transitions.
Treatment of property Parking-PT-416-LTLCardinality-12 finished in 49627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U G(!p1)))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 253 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 253 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 236 transition count 207
Applied a total of 72 rules in 22 ms. Remains 236 /273 variables (removed 37) and now considering 207/244 (removed 37) transitions.
// Phase 1: matrix 207 rows 236 cols
[2024-06-01 12:35:03] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 12:35:03] [INFO ] Implicit Places using invariants in 253 ms returned [60, 76, 78, 129, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 255 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 207/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 205
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 6 place count 228 transition count 204
Applied a total of 6 rules in 12 ms. Remains 228 /231 variables (removed 3) and now considering 204/207 (removed 3) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-06-01 12:35:03] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:35:03] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 12:35:03] [INFO ] Invariant cache hit.
[2024-06-01 12:35:04] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 204/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1021 ms. Remains : 228/273 places, 204/244 transitions.
Stuttering acceptance computed with spot in 103 ms :[p1, p0]
Running random walk in product with property : Parking-PT-416-LTLCardinality-13
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-13 finished in 1147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(p1)&&(G(p0)||p2)))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 11 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-06-01 12:35:04] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 12:35:04] [INFO ] Implicit Places using invariants in 338 ms returned [83, 85, 145, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 339 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/273 places, 241/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 8 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-06-01 12:35:04] [INFO ] Computed 53 invariants in 2 ms
[2024-06-01 12:35:05] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-01 12:35:05] [INFO ] Invariant cache hit.
[2024-06-01 12:35:05] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:05] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/273 places, 238/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1382 ms. Remains : 263/273 places, 238/244 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLCardinality-14
Product exploration explored 100000 steps with 5916 reset in 863 ms.
Product exploration explored 100000 steps with 5900 reset in 960 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 p2 p0 p1), (X (NOT p2)), (X (OR p2 p0)), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 13 factoid took 712 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 38702 steps (501 resets) in 350 ms. (110 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p2 p0 p1), (X (NOT p2)), (X (OR p2 p0)), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 13 factoid took 1699 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-06-01 12:35:11] [INFO ] Invariant cache hit.
[2024-06-01 12:35:12] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 12:35:12] [INFO ] Invariant cache hit.
[2024-06-01 12:35:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:12] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-01 12:35:12] [INFO ] Invariant cache hit.
[2024-06-01 12:35:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 380 constraints, problems are : Problem set: 0 solved, 237 unsolved in 24239 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 237/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 617 constraints, problems are : Problem set: 0 solved, 237 unsolved in 25552 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints]
After SMT, in 49859ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 49864ms
Finished structural reductions in LTL mode , in 1 iterations and 50701 ms. Remains : 263/263 places, 238/238 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 p0 p2 p1), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 914 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (513 resets) in 309 ms. (129 steps per ms) remains 1/12 properties
BEST_FIRST walk for 26266 steps (12 resets) in 60 ms. (430 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 13 factoid took 1844 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5907 reset in 708 ms.
Product exploration explored 100000 steps with 5966 reset in 543 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 263 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 263 transition count 238
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 255 transition count 230
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 255 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 255 transition count 238
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 48 rules in 49 ms. Remains 255 /263 variables (removed 8) and now considering 238/238 (removed 0) transitions.
[2024-06-01 12:36:09] [INFO ] Redundant transitions in 1 ms returned []
Running 237 sub problems to find dead transitions.
// Phase 1: matrix 238 rows 255 cols
[2024-06-01 12:36:09] [INFO ] Computed 53 invariants in 2 ms
[2024-06-01 12:36:09] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:36:13] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 238/493 variables, 255/316 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 92/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 408 constraints, problems are : Problem set: 32 solved, 205 unsolved in 21934 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 255/255 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 32 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 25/255 variables, 53/53 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 238/493 variables, 255/316 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 92/408 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 205/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/613 constraints. Problems are: Problem set: 32 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 613 constraints, problems are : Problem set: 32 solved, 205 unsolved in 21046 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 255/255 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 205/237 constraints, Known Traps: 8/8 constraints]
After SMT, in 43054ms problems are : Problem set: 32 solved, 205 unsolved
Search for dead transitions found 32 dead transitions in 43061ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/263 places, 206/238 transitions.
Graph (complete) has 620 edges and 255 vertex of which 231 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 231 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 11 ms. Remains 231 /255 variables (removed 24) and now considering 230/206 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/263 places, 230/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43135 ms. Remains : 231/263 places, 230/238 transitions.
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-06-01 12:36:52] [INFO ] Computed 53 invariants in 2 ms
[2024-06-01 12:36:52] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 12:36:52] [INFO ] Invariant cache hit.
[2024-06-01 12:36:52] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:36:53] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-01 12:36:53] [INFO ] Invariant cache hit.
[2024-06-01 12:36:53] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:36:57] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 380 constraints, problems are : Problem set: 0 solved, 237 unsolved in 21701 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/501 variables, 263/320 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/380 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 237/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 617 constraints, problems are : Problem set: 0 solved, 237 unsolved in 23418 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 263/263 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints]
After SMT, in 45161ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 45165ms
Finished structural reductions in LTL mode , in 1 iterations and 46057 ms. Remains : 263/263 places, 238/238 transitions.
Treatment of property Parking-PT-416-LTLCardinality-14 finished in 154089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(p1)&&(G(p0)||p2)))))'
[2024-06-01 12:37:38] [INFO ] Flatten gal took : 24 ms
[2024-06-01 12:37:38] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 12:37:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 244 transitions and 815 arcs took 9 ms.
Total runtime 364705 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-416-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717246085368

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-416-LTLCardinality-06
ltl formula formula --ltl=/tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 244 transitions and 815 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 274 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 274, there are 250 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~92 levels ~10000 states ~51052 transitions
pnml2lts-mc( 1/ 4): ~110 levels ~20000 states ~98108 transitions
pnml2lts-mc( 1/ 4): ~165 levels ~40000 states ~195900 transitions
pnml2lts-mc( 1/ 4): ~165 levels ~80000 states ~431624 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~160000 states ~1030176 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~320000 states ~2198400 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~640000 states ~4641096 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~1280000 states ~9150524 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~2560000 states ~19328036 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~5120000 states ~41437460 transitions
pnml2lts-mc( 0/ 4): ~107 levels ~10240000 states ~88222124 transitions
pnml2lts-mc( 3/ 4): ~72 levels ~20480000 states ~191787576 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32283172
pnml2lts-mc( 0/ 4): unique states count: 33547134
pnml2lts-mc( 0/ 4): unique transitions count: 312787019
pnml2lts-mc( 0/ 4): - self-loop count: 145
pnml2lts-mc( 0/ 4): - claim dead count: 277534005
pnml2lts-mc( 0/ 4): - claim found count: 1698263
pnml2lts-mc( 0/ 4): - claim success count: 33547140
pnml2lts-mc( 0/ 4): - cum. max stack depth: 613
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547140 states 312787229 transitions, fanout: 9.324
pnml2lts-mc( 0/ 4): Total exploration time 249.500 sec (249.490 sec minimum, 249.497 sec on average)
pnml2lts-mc( 0/ 4): States per second: 134457, Transitions per second: 1253656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.4MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.4MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLCardinality-10
ltl formula formula --ltl=/tmp/1720/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 244 transitions and 815 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 274 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 274, there are 256 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~89 levels ~10000 states ~63436 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~20000 states ~121876 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~40000 states ~249576 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~80000 states ~525160 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~160000 states ~1117016 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~320000 states ~2380768 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~640000 states ~5068364 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~1280000 states ~10281816 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~2560000 states ~21045572 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~5120000 states ~45671004 transitions
pnml2lts-mc( 3/ 4): ~89 levels ~10240000 states ~98153380 transitions
pnml2lts-mc( 1/ 4): ~82 levels ~20480000 states ~188750464 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33158885
pnml2lts-mc( 0/ 4): unique states count: 33546920
pnml2lts-mc( 0/ 4): unique transitions count: 406831282
pnml2lts-mc( 0/ 4): - self-loop count: 21
pnml2lts-mc( 0/ 4): - claim dead count: 372272250
pnml2lts-mc( 0/ 4): - claim found count: 997686
pnml2lts-mc( 0/ 4): - claim success count: 33546926
pnml2lts-mc( 0/ 4): - cum. max stack depth: 526
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33546926 states 406831696 transitions, fanout: 12.127
pnml2lts-mc( 0/ 4): Total exploration time 272.920 sec (272.890 sec minimum, 272.908 sec on average)
pnml2lts-mc( 0/ 4): States per second: 122919, Transitions per second: 1490663
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.3MB, 8.2 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.3MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLCardinality-12
ltl formula formula --ltl=/tmp/1720/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 244 transitions and 815 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 275 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 274, there are 257 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~77 levels ~10000 states ~20536 transitions
pnml2lts-mc( 3/ 4): ~69 levels ~20000 states ~36472 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~40000 states ~68512 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~80000 states ~135316 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~160000 states ~273032 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~320000 states ~555084 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~640000 states ~1156880 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~1280000 states ~2403360 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~2560000 states ~4938656 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~5120000 states ~10296548 transitions
pnml2lts-mc( 0/ 4): ~77 levels ~10240000 states ~21439568 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~74!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17749647
pnml2lts-mc( 0/ 4): unique states count: 17749919
pnml2lts-mc( 0/ 4): unique transitions count: 38904714
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 21147871
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 17749925
pnml2lts-mc( 0/ 4): - cum. max stack depth: 322
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17749925 states 38904928 transitions, fanout: 2.192
pnml2lts-mc( 0/ 4): Total exploration time 93.990 sec (93.990 sec minimum, 93.990 sec on average)
pnml2lts-mc( 0/ 4): States per second: 188849, Transitions per second: 413926
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 136.1MB, 8.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 52.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 136.1MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLCardinality-14
ltl formula formula --ltl=/tmp/1720/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 244 transitions and 815 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1720/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1720/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1720/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1720/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 274 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 274, there are 841 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~73 levels ~10000 states ~29520 transitions
pnml2lts-mc( 0/ 4): ~76 levels ~20000 states ~52736 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~40000 states ~119532 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~80000 states ~220976 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~160000 states ~468364 transitions
pnml2lts-mc( 2/ 4): ~68 levels ~320000 states ~1237496 transitions
pnml2lts-mc( 2/ 4): ~68 levels ~640000 states ~2627236 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~63!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 967801
pnml2lts-mc( 0/ 4): unique states count: 969852
pnml2lts-mc( 0/ 4): unique transitions count: 3809922
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2831138
pnml2lts-mc( 0/ 4): - claim found count: 2057
pnml2lts-mc( 0/ 4): - claim success count: 969858
pnml2lts-mc( 0/ 4): - cum. max stack depth: 329
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 969858 states 3810337 transitions, fanout: 3.929
pnml2lts-mc( 0/ 4): Total exploration time 7.700 sec (7.700 sec minimum, 7.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 125956, Transitions per second: 494849
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 7.7MB, 8.2 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 7.7MB (~256.0MB paged-in)

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-416"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Parking-PT-416, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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