MCC'2024- Execution of r512-smll-171654406900084

About the Execution of LTSMin+red for Parking-PT-432

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
591.628	2202945.00	7193113.00	2041.60	FFFFFTFTFTFFFFFF	normal

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-171654406900084.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-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 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 192K 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-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717246316038

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:51:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:51:59] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-06-01 12:51:59] [INFO ] Transformed 529 places.
[2024-06-01 12:51:59] [INFO ] Transformed 785 transitions.
[2024-06-01 12:51:59] [INFO ] Found NUPN structural information;
[2024-06-01 12:51:59] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 193 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2024-06-01 12:51:59] [INFO ] Computed 124 invariants in 52 ms
[2024-06-01 12:52:01] [INFO ] Implicit Places using invariants in 1212 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 237, 245, 269, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1283 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/529 places, 453/457 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 455 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 455 transition count 422
Applied a total of 62 rules in 97 ms. Remains 455 /486 variables (removed 31) and now considering 422/453 (removed 31) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:52:01] [INFO ] Computed 85 invariants in 8 ms
[2024-06-01 12:52:01] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 12:52:01] [INFO ] Invariant cache hit.
[2024-06-01 12:52:02] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:52:02] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/529 places, 422/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3287 ms. Remains : 455/529 places, 422/457 transitions.
Support contains 48 out of 455 places after structural reductions.
[2024-06-01 12:52:03] [INFO ] Flatten gal took : 150 ms
[2024-06-01 12:52:03] [INFO ] Flatten gal took : 67 ms
[2024-06-01 12:52:03] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 45 out of 455 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (362 resets) in 3176 ms. (12 steps per ms) remains 3/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
[2024-06-01 12:52:04] [INFO ] Invariant cache hit.
[2024-06-01 12:52:04] [INFO ] State equation strengthened by 108 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 161/455 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 648 constraints, problems are : Problem set: 0 solved, 3 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 161/455 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/877 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 651 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2205ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 309 ms.
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 455 transition count 408
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 441 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 441 transition count 394
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 427 transition count 394
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 106 place count 402 transition count 369
Free-agglomeration rule applied 115 times.
Iterating global reduction 2 with 115 rules applied. Total rules applied 221 place count 402 transition count 254
Reduce places removed 115 places and 0 transitions.
Graph (complete) has 589 edges and 287 vertex of which 149 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.2 ms
Discarding 138 places :
Also discarding 117 output transitions
Drop transitions (Output transitions of discarded places.) removed 117 transitions
Iterating post reduction 2 with 116 rules applied. Total rules applied 337 place count 149 transition count 137
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 345 place count 149 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 148 transition count 128
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 124 edges and 104 vertex of which 94 / 104 are part of one of the 2 SCC in 3 ms
Free SCC test removed 92 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 49 rules applied. Total rules applied 395 place count 12 transition count 124
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 122 rules applied. Total rules applied 517 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 519 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 519 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 4 transition count 4
Applied a total of 523 rules in 158 ms. Remains 4 /455 variables (removed 451) and now considering 4/422 (removed 418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 4/455 places, 4/422 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 455 transition count 407
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 440 transition count 407
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 440 transition count 391
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 424 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 120 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-06-01 12:52:08] [INFO ] Computed 85 invariants in 6 ms
[2024-06-01 12:52:08] [INFO ] Implicit Places using invariants in 389 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/455 places, 368/422 transitions.
Applied a total of 0 rules in 31 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 400/455 places, 368/422 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-01
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 9 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 927 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(p0)||F(p1))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 12 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:52:09] [INFO ] Computed 85 invariants in 7 ms
[2024-06-01 12:52:09] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 12:52:09] [INFO ] Invariant cache hit.
[2024-06-01 12:52:09] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:52:10] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-06-01 12:52:10] [INFO ] Invariant cache hit.
[2024-06-01 12:52:10] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 12:52:23] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 22 ms to minimize.
[2024-06-01 12:52:24] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 4 ms to minimize.
[2024-06-01 12:52:24] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:52:25] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
SMT process timed out in 30245ms, After SMT, problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 30261ms
Finished structural reductions in LTL mode , in 1 iterations and 32040 ms. Remains : 455/455 places, 422/422 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-02
Product exploration explored 100000 steps with 2081 reset in 1143 ms.
Product exploration explored 100000 steps with 2080 reset in 897 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 p1 (NOT p0)), (X (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)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 441 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 591 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 2380 steps (20 resets) in 31 ms. (74 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (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)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 647 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 75 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-06-01 12:52:46] [INFO ] Computed 85 invariants in 3 ms
[2024-06-01 12:52:46] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 12:52:46] [INFO ] Invariant cache hit.
[2024-06-01 12:52:46] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-06-01 12:52:47] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2024-06-01 12:52:47] [INFO ] Redundant transitions in 26 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 12:52:47] [INFO ] Invariant cache hit.
[2024-06-01 12:52:47] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 12:52:56] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 631 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 367/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 998 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 401/455 places, 368/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62226 ms. Remains : 401/455 places, 368/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 575 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 2098 steps (17 resets) in 27 ms. (74 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 758 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 456 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 451 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2088 reset in 1073 ms.
Product exploration explored 100000 steps with 2039 reset in 762 ms.
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 368/368 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-06-01 12:53:53] [INFO ] Invariant cache hit.
[2024-06-01 12:53:53] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 12:53:53] [INFO ] Invariant cache hit.
[2024-06-01 12:53:54] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-06-01 12:53:55] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2024-06-01 12:53:55] [INFO ] Redundant transitions in 12 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 12:53:55] [INFO ] Invariant cache hit.
[2024-06-01 12:53:55] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 12:54:05] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 631 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 367/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 998 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62132 ms. Remains : 401/401 places, 368/368 transitions.
Treatment of property Parking-PT-432-LTLFireability-02 finished in 166510 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 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:54:55] [INFO ] Computed 85 invariants in 4 ms
[2024-06-01 12:54:55] [INFO ] Implicit Places using invariants in 422 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 17 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 12:54:55] [INFO ] Computed 84 invariants in 4 ms
[2024-06-01 12:54:56] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-06-01 12:54:56] [INFO ] Invariant cache hit.
[2024-06-01 12:54:56] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:54:57] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2135 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-04
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-04 finished in 2268 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 U (p1||G(!p0))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 454 transition count 405
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 438 transition count 405
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 438 transition count 389
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 422 transition count 389
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 398 transition count 365
Applied a total of 112 rules in 56 ms. Remains 398 /455 variables (removed 57) and now considering 365/422 (removed 57) transitions.
// Phase 1: matrix 365 rows 398 cols
[2024-06-01 12:54:57] [INFO ] Computed 85 invariants in 3 ms
[2024-06-01 12:54:58] [INFO ] Implicit Places using invariants in 465 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 468 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/455 places, 365/422 transitions.
Applied a total of 0 rules in 16 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 541 ms. Remains : 397/455 places, 365/422 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05
Product exploration explored 100000 steps with 964 reset in 756 ms.
Product exploration explored 100000 steps with 960 reset in 705 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 3862 steps (33 resets) in 49 ms. (77 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 23 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 397 cols
[2024-06-01 12:55:00] [INFO ] Computed 84 invariants in 3 ms
[2024-06-01 12:55:01] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-06-01 12:55:01] [INFO ] Invariant cache hit.
[2024-06-01 12:55:02] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2024-06-01 12:55:02] [INFO ] Redundant transitions in 10 ms returned []
Running 249 sub problems to find dead transitions.
[2024-06-01 12:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 481 constraints, problems are : Problem set: 0 solved, 249 unsolved in 24461 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 249/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 730 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22848 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 47377ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 47384ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48863 ms. Remains : 397/397 places, 365/365 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 9310 steps (85 resets) in 124 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 963 reset in 546 ms.
Product exploration explored 100000 steps with 965 reset in 608 ms.
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-06-01 12:55:51] [INFO ] Invariant cache hit.
[2024-06-01 12:55:52] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-01 12:55:52] [INFO ] Invariant cache hit.
[2024-06-01 12:55:52] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-06-01 12:55:52] [INFO ] Redundant transitions in 10 ms returned []
Running 249 sub problems to find dead transitions.
[2024-06-01 12:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 481 constraints, problems are : Problem set: 0 solved, 249 unsolved in 17614 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 249/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 730 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22803 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 40464ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 40468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41401 ms. Remains : 397/397 places, 365/365 transitions.
Treatment of property Parking-PT-432-LTLFireability-05 finished in 95614 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)||X((p0 U p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:56:33] [INFO ] Computed 85 invariants in 5 ms
[2024-06-01 12:56:33] [INFO ] Implicit Places using invariants in 421 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 422 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 17 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 12:56:33] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 12:56:34] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 12:56:34] [INFO ] Invariant cache hit.
[2024-06-01 12:56:34] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:56:35] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1702 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 1838 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(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 12:56:35] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 12:56:35] [INFO ] Implicit Places using invariants in 314 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 13 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 12:56:35] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 12:56:36] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 12:56:36] [INFO ] Invariant cache hit.
[2024-06-01 12:56:36] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:56:36] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1754 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-07
Product exploration explored 100000 steps with 905 reset in 564 ms.
Product exploration explored 100000 steps with 908 reset in 633 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 106 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (363 resets) in 816 ms. (48 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
[2024-06-01 12:56:39] [INFO ] Invariant cache hit.
[2024-06-01 12:56:39] [INFO ] State equation strengthened by 108 read => feed constraints.
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/453 variables, 81/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/145 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1069ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3))), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1), (F p0), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 14 factoid took 576 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-01 12:56:41] [INFO ] Invariant cache hit.
[2024-06-01 12:56:41] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-06-01 12:56:41] [INFO ] Invariant cache hit.
[2024-06-01 12:56:41] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:56:42] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-01 12:56:42] [INFO ] Invariant cache hit.
[2024-06-01 12:56:42] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:56:51] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 61403 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (358 resets) in 620 ms. (64 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-06-01 12:57:43] [INFO ] Invariant cache hit.
[2024-06-01 12:57:43] [INFO ] State equation strengthened by 108 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) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 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) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:57:43] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:57:44] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:57:44] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1172ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1065 steps, including 18 resets, run visited all 1 properties in 8 ms. (steps per millisecond=133 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1)]
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 915 reset in 566 ms.
Product exploration explored 100000 steps with 915 reset in 632 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 421
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 15 place count 453 transition count 421
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 30 place count 453 transition count 421
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 45 place count 438 transition count 406
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 60 place count 438 transition count 406
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 4 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 438 transition count 420
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 81 rules in 143 ms. Remains 438 /453 variables (removed 15) and now considering 420/421 (removed 1) transitions.
[2024-06-01 12:57:47] [INFO ] Redundant transitions in 2 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 420 rows 438 cols
[2024-06-01 12:57:47] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 12:57:47] [INFO ] State equation strengthened by 153 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 12:57:54] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 12:57:55] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:57:56] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 0/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/858 variables, and 683 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 50 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 37/438 variables, 84/84 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 369/1052 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 0/1052 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/858 variables, and 1052 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 369/419 constraints, Known Traps: 8/8 constraints]
After SMT, in 60133ms problems are : Problem set: 50 solved, 369 unsolved
Search for dead transitions found 50 dead transitions in 60140ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 438/453 places, 370/421 transitions.
Graph (complete) has 1092 edges and 438 vertex of which 402 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 402 /438 variables (removed 36) and now considering 370/370 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/453 places, 370/421 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60336 ms. Remains : 402/453 places, 370/421 transitions.
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 18 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 12:58:47] [INFO ] Computed 84 invariants in 5 ms
[2024-06-01 12:58:48] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-06-01 12:58:48] [INFO ] Invariant cache hit.
[2024-06-01 12:58:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:58:48] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-01 12:58:48] [INFO ] Invariant cache hit.
[2024-06-01 12:58:49] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-01 12:58:56] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:58:56] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:58:57] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:58:57] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 61736 ms. Remains : 453/453 places, 421/421 transitions.
Treatment of property Parking-PT-432-LTLFireability-07 finished in 193926 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||(p1&&X(G((p1||G(p2)))))))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 454 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 439 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 439 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 424 transition count 391
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 399 transition count 366
Applied a total of 110 rules in 29 ms. Remains 399 /455 variables (removed 56) and now considering 366/422 (removed 56) transitions.
// Phase 1: matrix 366 rows 399 cols
[2024-06-01 12:59:49] [INFO ] Computed 85 invariants in 1 ms
[2024-06-01 12:59:49] [INFO ] Implicit Places using invariants in 488 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/455 places, 366/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 398/455 places, 366/422 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-09
Product exploration explored 100000 steps with 950 reset in 560 ms.
Product exploration explored 100000 steps with 953 reset in 632 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 p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 139 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (372 resets) in 674 ms. (59 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
// Phase 1: matrix 366 rows 398 cols
[2024-06-01 12:59:51] [INFO ] Computed 84 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/764 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/764 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 422 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-06-01 12:59:53] [INFO ] Invariant cache hit.
[2024-06-01 12:59:53] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-01 12:59:53] [INFO ] Invariant cache hit.
[2024-06-01 12:59:54] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-06-01 12:59:54] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
[2024-06-01 12:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 17747 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 23613 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 41434ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 41438ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42307 ms. Remains : 398/398 places, 366/366 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 (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 138 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 30544 steps (280 resets) in 438 ms. (69 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 522 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 953 reset in 593 ms.
Product exploration explored 100000 steps with 948 reset in 658 ms.
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-06-01 13:00:38] [INFO ] Invariant cache hit.
[2024-06-01 13:00:39] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 13:00:39] [INFO ] Invariant cache hit.
[2024-06-01 13:00:39] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-06-01 13:00:39] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-06-01 13:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 17946 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 24130 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 42131ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 42134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43220 ms. Remains : 398/398 places, 366/366 transitions.
Treatment of property Parking-PT-432-LTLFireability-09 finished in 92757 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(p0)||X((p1||X(p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 13:01:21] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 13:01:22] [INFO ] Implicit Places using invariants in 321 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 13:01:22] [INFO ] Computed 84 invariants in 4 ms
[2024-06-01 13:01:22] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 13:01:22] [INFO ] Invariant cache hit.
[2024-06-01 13:01:22] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 13:01:23] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1614 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-11 finished in 1898 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' '!(((p0 U X(p1)) U p0))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 13:01:23] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 13:01:24] [INFO ] Implicit Places using invariants in 404 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 18 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 13:01:24] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 13:01:24] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 13:01:24] [INFO ] Invariant cache hit.
[2024-06-01 13:01:24] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 13:01:25] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1708 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 1820 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((((!X(F(p1)) U p2)&&G(p3))||p0))))'
Support contains 7 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 13:01:25] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 13:01:25] [INFO ] Implicit Places using invariants in 315 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 13:01:26] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 13:01:26] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 13:01:26] [INFO ] Invariant cache hit.
[2024-06-01 13:01:26] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 13:01:27] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1663 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 2 ms.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-13 finished in 1972 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(p1))||p0)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-06-01 13:01:27] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 13:01:27] [INFO ] Implicit Places using invariants in 320 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 20 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-06-01 13:01:27] [INFO ] Computed 84 invariants in 2 ms
[2024-06-01 13:01:28] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 13:01:28] [INFO ] Invariant cache hit.
[2024-06-01 13:01:28] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 13:01:29] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1610 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 1743 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(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' '!(G(F((!p0 U (p1||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(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
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||(p1&&X(G((p1||G(p2)))))))))'
[2024-06-01 13:01:29] [INFO ] Flatten gal took : 89 ms
[2024-06-01 13:01:29] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 13:01:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 455 places, 422 transitions and 1394 arcs took 7 ms.
Total runtime 571347 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-432-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-432-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-432-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717248518983

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-432-LTLFireability-02
ltl formula formula --ltl=/tmp/2036/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 455 places, 422 transitions and 1394 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.110 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2036/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2036/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2036/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2036/ltl_0_
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 457 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 456, there are 461 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~103!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 210
pnml2lts-mc( 0/ 4): unique states count: 533
pnml2lts-mc( 0/ 4): unique transitions count: 16051
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 539
pnml2lts-mc( 0/ 4): - cum. max stack depth: 329
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 539 states 16406 transitions, fanout: 30.438
pnml2lts-mc( 0/ 4): Total exploration time 0.200 sec (0.170 sec minimum, 0.183 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2695, Transitions per second: 82030
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 16.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name Parking-PT-432-LTLFireability-05
ltl formula formula --ltl=/tmp/2036/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 455 places, 422 transitions and 1394 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.010 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2036/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2036/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2036/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2036/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 456 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 456, there are 434 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( 2/ 4): ~123 levels ~10000 states ~64572 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~20000 states ~122776 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~40000 states ~249660 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~80000 states ~514784 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~160000 states ~1094040 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~320000 states ~2315104 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~640000 states ~4930480 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~1280000 states ~10482588 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~2560000 states ~22228156 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~5120000 states ~47001356 transitions
pnml2lts-mc( 2/ 4): ~123 levels ~10240000 states ~99096748 transitions
pnml2lts-mc( 3/ 4): ~165 levels ~20480000 states ~200682504 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33520898
pnml2lts-mc( 0/ 4): unique states count: 33536762
pnml2lts-mc( 0/ 4): unique transitions count: 351291013
pnml2lts-mc( 0/ 4): - self-loop count: 30
pnml2lts-mc( 0/ 4): - claim dead count: 317718635
pnml2lts-mc( 0/ 4): - claim found count: 17946
pnml2lts-mc( 0/ 4): - claim success count: 33536768
pnml2lts-mc( 0/ 4): - cum. max stack depth: 528
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33536768 states 351291367 transitions, fanout: 10.475
pnml2lts-mc( 0/ 4): Total exploration time 606.470 sec (606.470 sec minimum, 606.470 sec on average)
pnml2lts-mc( 0/ 4): States per second: 55298, Transitions per second: 579240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 263.8MB, 8.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 263.8MB (~256.0MB paged-in)
ltl formula name Parking-PT-432-LTLFireability-07
ltl formula formula --ltl=/tmp/2036/ltl_2_
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
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 455 places, 422 transitions and 1394 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.050 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2036/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2036/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2036/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2036/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 456 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 456, there are 461 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): ~99 levels ~10000 states ~60244 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~20000 states ~120736 transitions
pnml2lts-mc( 2/ 4): ~156 levels ~40000 states ~239796 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~80000 states ~433684 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~160000 states ~988584 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~320000 states ~2259304 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~640000 states ~4830792 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~1280000 states ~9871308 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~2560000 states ~20932624 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~5120000 states ~44363104 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~10240000 states ~93652912 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~20480000 states ~194969888 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33446722
pnml2lts-mc( 0/ 4): unique states count: 33536619
pnml2lts-mc( 0/ 4): unique transitions count: 343779367
pnml2lts-mc( 0/ 4): - self-loop count: 35
pnml2lts-mc( 0/ 4): - claim dead count: 310092499
pnml2lts-mc( 0/ 4): - claim found count: 132193
pnml2lts-mc( 0/ 4): - claim success count: 33536625
pnml2lts-mc( 0/ 4): - cum. max stack depth: 848
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33536625 states 343779721 transitions, fanout: 10.251
pnml2lts-mc( 0/ 4): Total exploration time 471.020 sec (470.990 sec minimum, 471.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: 71200, Transitions per second: 729862
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.8MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.8MB (~256.0MB paged-in)
ltl formula name Parking-PT-432-LTLFireability-09
ltl formula formula --ltl=/tmp/2036/ltl_3_
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
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 455 places, 422 transitions and 1394 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2036/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2036/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2036/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2036/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 456 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 456, there are 531 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): ~119 levels ~10000 states ~54520 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~20000 states ~94668 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~40000 states ~177300 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~80000 states ~362700 transitions
pnml2lts-mc( 0/ 4): ~162 levels ~160000 states ~715644 transitions
pnml2lts-mc( 0/ 4): ~162 levels ~320000 states ~1471368 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~640000 states ~2559828 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~1280000 states ~6541768 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~2560000 states ~13621356 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~5120000 states ~24718704 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~10240000 states ~51975948 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~20480000 states ~109048972 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32894545
pnml2lts-mc( 0/ 4): unique states count: 33536760
pnml2lts-mc( 0/ 4): unique transitions count: 291346270
pnml2lts-mc( 0/ 4): - self-loop count: 244
pnml2lts-mc( 0/ 4): - claim dead count: 256373189
pnml2lts-mc( 0/ 4): - claim found count: 1406965
pnml2lts-mc( 0/ 4): - claim success count: 33536766
pnml2lts-mc( 0/ 4): - cum. max stack depth: 858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33536766 states 291346978 transitions, fanout: 8.687
pnml2lts-mc( 0/ 4): Total exploration time 548.660 sec (548.640 sec minimum, 548.645 sec on average)
pnml2lts-mc( 0/ 4): States per second: 61125, Transitions per second: 531016
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 266.5MB, 8.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 266.5MB (~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-432"
export BK_EXAMINATION="LTLFireability"
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-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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