About the Execution of ITS-Tools for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1525.279 | 91033.00 | 205199.00 | 587.40 | FFFTFTFFFTFFFFFF | 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.r268-smll-171654406800067.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 itstools
Input is Parking-PT-208, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406800067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K 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-208-LTLCardinality-00
FORMULA_NAME Parking-PT-208-LTLCardinality-01
FORMULA_NAME Parking-PT-208-LTLCardinality-02
FORMULA_NAME Parking-PT-208-LTLCardinality-03
FORMULA_NAME Parking-PT-208-LTLCardinality-04
FORMULA_NAME Parking-PT-208-LTLCardinality-05
FORMULA_NAME Parking-PT-208-LTLCardinality-06
FORMULA_NAME Parking-PT-208-LTLCardinality-07
FORMULA_NAME Parking-PT-208-LTLCardinality-08
FORMULA_NAME Parking-PT-208-LTLCardinality-09
FORMULA_NAME Parking-PT-208-LTLCardinality-10
FORMULA_NAME Parking-PT-208-LTLCardinality-11
FORMULA_NAME Parking-PT-208-LTLCardinality-12
FORMULA_NAME Parking-PT-208-LTLCardinality-13
FORMULA_NAME Parking-PT-208-LTLCardinality-14
FORMULA_NAME Parking-PT-208-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716655335883
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 16:42:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:42:19] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-25 16:42:19] [INFO ] Transformed 137 places.
[2024-05-25 16:42:19] [INFO ] Transformed 201 transitions.
[2024-05-25 16:42:19] [INFO ] Found NUPN structural information;
[2024-05-25 16:42:19] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Parking-PT-208-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 135 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 115
Applied a total of 4 rules in 57 ms. Remains 135 /137 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 135 cols
[2024-05-25 16:42:19] [INFO ] Computed 34 invariants in 17 ms
[2024-05-25 16:42:20] [INFO ] Implicit Places using invariants in 532 ms returned [36, 44, 52, 64, 66, 93, 109, 129, 131]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 616 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 115/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 113
Applied a total of 4 rules in 19 ms. Remains 124 /126 variables (removed 2) and now considering 113/115 (removed 2) transitions.
// Phase 1: matrix 113 rows 124 cols
[2024-05-25 16:42:20] [INFO ] Computed 25 invariants in 6 ms
[2024-05-25 16:42:20] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-25 16:42:20] [INFO ] Invariant cache hit.
[2024-05-25 16:42:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:20] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 113/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1349 ms. Remains : 124/137 places, 113/117 transitions.
Support contains 38 out of 124 places after structural reductions.
[2024-05-25 16:42:21] [INFO ] Flatten gal took : 71 ms
[2024-05-25 16:42:21] [INFO ] Flatten gal took : 33 ms
[2024-05-25 16:42:21] [INFO ] Input system was already deterministic with 113 transitions.
Support contains 37 out of 124 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (1152 resets) in 1907 ms. (20 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40004 steps (100 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
[2024-05-25 16:42:22] [INFO ] Invariant cache hit.
[2024-05-25 16:42:22] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/84 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/124 variables, 20/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 175 constraints, problems are : Problem set: 1 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 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) 38/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/124 variables, 24/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 102 transition count 91
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 71 place count 102 transition count 64
Reduce places removed 27 places and 0 transitions.
Graph (complete) has 157 edges and 75 vertex of which 40 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Iterating post reduction 2 with 28 rules applied. Total rules applied 99 place count 40 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 40 transition count 33
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 40 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 38 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 37 transition count 30
Reduce places removed 11 places and 0 transitions.
Graph (trivial) has 22 edges and 26 vertex of which 8 / 26 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 21 rules applied. Total rules applied 127 place count 19 transition count 21
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 24 rules applied. Total rules applied 151 place count 9 transition count 7
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 156 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 157 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 157 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 159 place count 4 transition count 4
Applied a total of 159 rules in 92 ms. Remains 4 /124 variables (removed 120) and now considering 4/113 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 4/124 places, 4/113 transitions.
RANDOM walk for 12 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/1 properties
FORMULA Parking-PT-208-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Parking-PT-208-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 7 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:42:23] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:42:23] [INFO ] Implicit Places using invariants in 144 ms returned [28, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 108
Applied a total of 4 rules in 6 ms. Remains 117 /119 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-05-25 16:42:23] [INFO ] Computed 23 invariants in 2 ms
[2024-05-25 16:42:23] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-25 16:42:23] [INFO ] Invariant cache hit.
[2024-05-25 16:42:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:23] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 530 ms. Remains : 117/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-208-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-00 finished in 961 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((p0&&G((X(X(F(p2)))||p1)))))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 7 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:42:24] [INFO ] Computed 25 invariants in 5 ms
[2024-05-25 16:42:24] [INFO ] Implicit Places using invariants in 146 ms returned [28, 92, 106]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 158 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Applied a total of 6 rules in 17 ms. Remains 115 /118 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:42:24] [INFO ] Computed 22 invariants in 3 ms
[2024-05-25 16:42:24] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-25 16:42:24] [INFO ] Invariant cache hit.
[2024-05-25 16:42:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:24] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 115/124 places, 107/113 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-01 finished in 1029 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)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:42:25] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:42:25] [INFO ] Implicit Places using invariants in 161 ms returned [28, 92, 106]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 166 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Applied a total of 6 rules in 4 ms. Remains 115 /118 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:42:25] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:42:25] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-25 16:42:25] [INFO ] Invariant cache hit.
[2024-05-25 16:42:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:25] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 115/124 places, 107/113 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1642 steps with 47 reset in 55 ms.
FORMULA Parking-PT-208-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-02 finished in 914 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((p1 U X(p2)))||p0))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:42:25] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:42:26] [INFO ] Implicit Places using invariants in 131 ms returned [28, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 108
Applied a total of 4 rules in 15 ms. Remains 117 /119 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-05-25 16:42:26] [INFO ] Computed 23 invariants in 2 ms
[2024-05-25 16:42:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 16:42:26] [INFO ] Invariant cache hit.
[2024-05-25 16:42:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:26] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 616 ms. Remains : 117/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-03
Product exploration explored 100000 steps with 25212 reset in 746 ms.
Product exploration explored 100000 steps with 25216 reset in 679 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 596 steps (15 resets) in 25 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 275 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-25 16:42:29] [INFO ] Invariant cache hit.
[2024-05-25 16:42:29] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 16:42:29] [INFO ] Invariant cache hit.
[2024-05-25 16:42:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:29] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-25 16:42:29] [INFO ] Invariant cache hit.
[2024-05-25 16:42:29] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-25 16:42:31] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 16 ms to minimize.
[2024-05-25 16:42:31] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 168 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5244 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 107/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4747 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 10073ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10081ms
Finished structural reductions in LTL mode , in 1 iterations and 10510 ms. Remains : 117/117 places, 108/108 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 567 steps (15 resets) in 15 ms. (35 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 270 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25204 reset in 515 ms.
Product exploration explored 100000 steps with 25226 reset in 681 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 117 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 117 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 114 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 114 transition count 105
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 114 transition count 109
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 20 rules in 29 ms. Remains 114 /117 variables (removed 3) and now considering 109/108 (removed -1) transitions.
[2024-05-25 16:42:42] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 109 rows 114 cols
[2024-05-25 16:42:42] [INFO ] Computed 23 invariants in 3 ms
[2024-05-25 16:42:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 16:42:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-25 16:42:44] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-25 16:42:44] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-25 16:42:44] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 109/223 variables, 114/141 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 41/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 182 constraints, problems are : Problem set: 15 solved, 93 unsolved in 5303 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 15 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 12/114 variables, 23/23 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 109/223 variables, 114/141 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 41/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 93/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 275 constraints, problems are : Problem set: 15 solved, 93 unsolved in 4578 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 93/108 constraints, Known Traps: 4/4 constraints]
After SMT, in 9928ms problems are : Problem set: 15 solved, 93 unsolved
Search for dead transitions found 15 dead transitions in 9932ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 94/108 transitions.
Graph (complete) has 274 edges and 114 vertex of which 103 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 17 ms. Remains 103 /114 variables (removed 11) and now considering 118/94 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/117 places, 118/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9995 ms. Remains : 103/117 places, 118/108 transitions.
Built C files in :
/tmp/ltsmin4454844793777554837
[2024-05-25 16:42:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4454844793777554837
Running compilation step : cd /tmp/ltsmin4454844793777554837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 783 ms.
Running link step : cd /tmp/ltsmin4454844793777554837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin4454844793777554837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17294905905810688230.hoa' '--buchi-type=spotba'
LTSmin run took 632 ms.
FORMULA Parking-PT-208-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLCardinality-03 finished in 28578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 119 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 119 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 115 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 112 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 112 transition count 101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 102 transition count 91
Applied a total of 42 rules in 23 ms. Remains 102 /124 variables (removed 22) and now considering 91/113 (removed 22) transitions.
// Phase 1: matrix 91 rows 102 cols
[2024-05-25 16:42:54] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:42:54] [INFO ] Implicit Places using invariants in 177 ms returned [26, 79, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 179 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/124 places, 91/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 99/124 places, 91/113 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-07
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-07 finished in 284 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||X(X(p1))))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 111
Applied a total of 4 rules in 5 ms. Remains 122 /124 variables (removed 2) and now considering 111/113 (removed 2) transitions.
// Phase 1: matrix 111 rows 122 cols
[2024-05-25 16:42:54] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:42:54] [INFO ] Implicit Places using invariants in 189 ms returned [28, 93, 107]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 190 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 111/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 108
Applied a total of 6 rules in 6 ms. Remains 116 /119 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 116 cols
[2024-05-25 16:42:54] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:42:55] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-25 16:42:55] [INFO ] Invariant cache hit.
[2024-05-25 16:42:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:42:55] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 116/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-208-LTLCardinality-10
Product exploration explored 100000 steps with 2907 reset in 336 ms.
Entered a terminal (fully accepting) state of product in 9783 steps with 284 reset in 34 ms.
FORMULA Parking-PT-208-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-10 finished in 1185 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(((p1&&(G(!p2)||(!p2&&F(p3))))||p0)))'
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 104
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 105 transition count 94
Applied a total of 38 rules in 28 ms. Remains 105 /124 variables (removed 19) and now considering 94/113 (removed 19) transitions.
// Phase 1: matrix 94 rows 105 cols
[2024-05-25 16:42:56] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:42:56] [INFO ] Implicit Places using invariants in 139 ms returned [82, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/124 places, 94/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 103/124 places, 94/113 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 10715 steps with 316 reset in 41 ms.
FORMULA Parking-PT-208-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-12 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 102 transition count 91
Applied a total of 44 rules in 20 ms. Remains 102 /124 variables (removed 22) and now considering 91/113 (removed 22) transitions.
// Phase 1: matrix 91 rows 102 cols
[2024-05-25 16:42:56] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:42:56] [INFO ] Implicit Places using invariants in 109 ms returned [26, 79, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 111 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/124 places, 91/113 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 110
Applied a total of 2 rules in 9 ms. Remains 98 /99 variables (removed 1) and now considering 110/91 (removed -19) transitions.
// Phase 1: matrix 110 rows 98 cols
[2024-05-25 16:42:56] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:42:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 16:42:56] [INFO ] Invariant cache hit.
[2024-05-25 16:42:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 16:42:56] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/124 places, 110/113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 98/124 places, 110/113 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-13
Product exploration explored 100000 steps with 3072 reset in 327 ms.
Product exploration explored 100000 steps with 3055 reset in 365 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 809 steps (23 resets) in 6 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-25 16:42:57] [INFO ] Invariant cache hit.
[2024-05-25 16:42:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-25 16:42:58] [INFO ] Invariant cache hit.
[2024-05-25 16:42:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 16:42:58] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-25 16:42:58] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-25 16:42:58] [INFO ] Invariant cache hit.
[2024-05-25 16:42:58] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 178 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3908 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 105/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 283 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5516 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 9462ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9740 ms. Remains : 98/98 places, 110/110 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 1221 steps (37 resets) in 9 ms. (122 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3051 reset in 310 ms.
Product exploration explored 100000 steps with 3065 reset in 646 ms.
Built C files in :
/tmp/ltsmin2285688237523315152
[2024-05-25 16:43:09] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-25 16:43:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:09] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-25 16:43:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:09] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-25 16:43:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:09] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2285688237523315152
Running compilation step : cd /tmp/ltsmin2285688237523315152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 428 ms.
Running link step : cd /tmp/ltsmin2285688237523315152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2285688237523315152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10638733485440393196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-25 16:43:24] [INFO ] Invariant cache hit.
[2024-05-25 16:43:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 16:43:24] [INFO ] Invariant cache hit.
[2024-05-25 16:43:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 16:43:24] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-25 16:43:24] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-25 16:43:24] [INFO ] Invariant cache hit.
[2024-05-25 16:43:24] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 178 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4885 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 105/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 283 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 8952ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8958ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9334 ms. Remains : 98/98 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin1389167103419817038
[2024-05-25 16:43:33] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-25 16:43:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:33] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-25 16:43:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:33] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-25 16:43:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:43:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1389167103419817038
Running compilation step : cd /tmp/ltsmin1389167103419817038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin1389167103419817038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1389167103419817038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3158663518434781569.hoa' '--buchi-type=spotba'
LTSmin run took 12663 ms.
FORMULA Parking-PT-208-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLCardinality-13 finished in 50484 ms.
All properties solved by simple procedures.
Total runtime 88273 ms.
BK_STOP 1716655426916
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-208"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Parking-PT-208, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;