About the Execution of ITS-Tools for CO4-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 548.163 | 59306.00 | 87574.00 | 303.70 | FTTTFTFFFFFTFTFF | 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.r550-tall-171734898400051.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 CO4-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898400051
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 98K Jun 2 16:33 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 CO4-PT-07-LTLCardinality-00
FORMULA_NAME CO4-PT-07-LTLCardinality-01
FORMULA_NAME CO4-PT-07-LTLCardinality-02
FORMULA_NAME CO4-PT-07-LTLCardinality-03
FORMULA_NAME CO4-PT-07-LTLCardinality-04
FORMULA_NAME CO4-PT-07-LTLCardinality-05
FORMULA_NAME CO4-PT-07-LTLCardinality-06
FORMULA_NAME CO4-PT-07-LTLCardinality-07
FORMULA_NAME CO4-PT-07-LTLCardinality-08
FORMULA_NAME CO4-PT-07-LTLCardinality-09
FORMULA_NAME CO4-PT-07-LTLCardinality-10
FORMULA_NAME CO4-PT-07-LTLCardinality-11
FORMULA_NAME CO4-PT-07-LTLCardinality-12
FORMULA_NAME CO4-PT-07-LTLCardinality-13
FORMULA_NAME CO4-PT-07-LTLCardinality-14
FORMULA_NAME CO4-PT-07-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717351442144
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:04:03] [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-06-02 18:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:04:03] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:04:03] [INFO ] Transformed 384 places.
[2024-06-02 18:04:03] [INFO ] Transformed 456 transitions.
[2024-06-02 18:04:03] [INFO ] Found NUPN structural information;
[2024-06-02 18:04:03] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 70 place count 215 transition count 274
Iterating global reduction 1 with 59 rules applied. Total rules applied 129 place count 215 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 215 transition count 271
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 160 place count 187 transition count 243
Iterating global reduction 2 with 28 rules applied. Total rules applied 188 place count 187 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 187 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 184 transition count 238
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 184 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 183 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 183 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 182 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 182 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 182 transition count 235
Applied a total of 200 rules in 75 ms. Remains 182 /284 variables (removed 102) and now considering 235/336 (removed 101) transitions.
// Phase 1: matrix 235 rows 182 cols
[2024-06-02 18:04:03] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 18:04:03] [INFO ] Implicit Places using invariants in 188 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 181/284 places, 235/336 transitions.
Applied a total of 0 rules in 3 ms. Remains 181 /181 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 309 ms. Remains : 181/284 places, 235/336 transitions.
Support contains 9 out of 181 places after structural reductions.
[2024-06-02 18:04:04] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:04:04] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:04:04] [INFO ] Input system was already deterministic with 235 transitions.
RANDOM walk for 40000 steps (34 resets) in 1149 ms. (34 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (48 resets) in 469 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (25 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (50 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
// Phase 1: matrix 235 rows 181 cols
[2024-06-02 18:04:04] [INFO ] Computed 3 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/71 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/220 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 139/359 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/368 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 40/408 variables, 27/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/416 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 184 constraints, problems are : Problem set: 0 solved, 3 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/71 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 149/220 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 139/359 variables, 72/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 9/368 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 40/408 variables, 27/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/416 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/416 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 187 constraints, problems are : Problem set: 0 solved, 3 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 163 steps, including 3 resets, run visited all 3 properties in 5 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 13 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 304 edges and 181 vertex of which 178 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 235/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 179 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 179 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 179 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 177 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 177 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 175 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 175 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 174 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 174 transition count 226
Applied a total of 15 rules in 13 ms. Remains 174 /181 variables (removed 7) and now considering 226/235 (removed 9) transitions.
// Phase 1: matrix 226 rows 174 cols
[2024-06-02 18:04:05] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 226/400 variables, 174/177 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:04:08] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 11 ms to minimize.
[2024-06-02 18:04:09] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 179 constraints, problems are : Problem set: 0 solved, 225 unsolved in 8002 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/400 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 225/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 7589 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
After SMT, in 15650ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 15654ms
Starting structural reductions in LTL mode, iteration 1 : 174/181 places, 226/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15826 ms. Remains : 174/181 places, 226/235 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLCardinality-14
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 3 ms.
FORMULA CO4-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLCardinality-14 finished in 16154 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&&X(F(((p0&&(G(p0)||F(!p1)))||G(F(!p1))))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 235/235 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 178 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 178 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 177 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 177 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 176 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 176 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 175 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 175 transition count 227
Applied a total of 13 rules in 22 ms. Remains 175 /181 variables (removed 6) and now considering 227/235 (removed 8) transitions.
// Phase 1: matrix 227 rows 175 cols
[2024-06-02 18:04:21] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:04:21] [INFO ] Invariant cache hit.
[2024-06-02 18:04:21] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 18:04:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 18:04:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
[2024-06-02 18:04:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7988 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 406 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
After SMT, in 15856ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 15861ms
Starting structural reductions in LTL mode, iteration 1 : 175/181 places, 227/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16031 ms. Remains : 175/181 places, 227/235 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-15
Product exploration explored 100000 steps with 19 reset in 187 ms.
Product exploration explored 100000 steps with 1 reset in 101 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (27 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (90 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (54 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (27 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (19 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 12992 steps, run visited all 4 properties in 66 ms. (steps per millisecond=196 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 69 ms. (steps per millisecond=188 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-02 18:04:39] [INFO ] Invariant cache hit.
[2024-06-02 18:04:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:04:39] [INFO ] Invariant cache hit.
[2024-06-02 18:04:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 18:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 18:04:42] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:04:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7853 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 406 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7599 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
After SMT, in 15498ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 15501ms
Finished structural reductions in LTL mode , in 1 iterations and 15665 ms. Remains : 175/175 places, 227/227 transitions.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (42 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (29 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (23 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (75 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 12992 steps, run visited all 4 properties in 42 ms. (steps per millisecond=309 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 42 ms. (steps per millisecond=309 ) properties seen :4
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 23 reset in 67 ms.
Product exploration explored 100000 steps with 16 reset in 165 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Graph (trivial) has 182 edges and 175 vertex of which 2 / 175 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 295 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 171 transition count 222
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 60 place count 171 transition count 241
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 79 place count 171 transition count 241
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 159 transition count 229
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 159 transition count 229
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 124 place count 159 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 159 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 149 transition count 236
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 149 transition count 236
Performed 25 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 172 place count 149 transition count 342
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 196 place count 149 transition count 318
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 244 place count 101 transition count 208
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 48 rules applied. Total rules applied 292 place count 101 transition count 208
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 309 place count 101 transition count 191
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 337 place count 73 transition count 140
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 365 place count 73 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 367 place count 73 transition count 138
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 371 place count 69 transition count 130
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 375 place count 69 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 69 transition count 144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 404 place count 68 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 405 place count 67 transition count 115
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 67 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 67 transition count 139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 409 rules in 80 ms. Remains 66 /175 variables (removed 109) and now considering 132/227 (removed 95) transitions.
[2024-06-02 18:04:56] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-02 18:04:56] [INFO ] Flow matrix only has 130 transitions (discarded 2 similar events)
// Phase 1: matrix 130 rows 66 cols
[2024-06-02 18:04:56] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:04:57] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:04:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 9 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:04:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 12 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 122 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 129/195 variables, 66/72 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 5/77 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 78 constraints, problems are : Problem set: 80 solved, 51 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 80 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 8/39 variables, 3/3 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/6 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 122/161 variables, 39/45 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 5/50 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 51/101 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/101 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 34/195 variables, 27/128 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/128 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 129 constraints, problems are : Problem set: 80 solved, 51 unsolved in 1487 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 51/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 3533ms problems are : Problem set: 80 solved, 51 unsolved
Search for dead transitions found 80 dead transitions in 3535ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/175 places, 52/227 transitions.
Graph (complete) has 97 edges and 66 vertex of which 32 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 32 /66 variables (removed 34) and now considering 52/52 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/175 places, 52/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3631 ms. Remains : 32/175 places, 52/227 transitions.
Built C files in :
/tmp/ltsmin8268442641147245489
[2024-06-02 18:05:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8268442641147245489
Running compilation step : cd /tmp/ltsmin8268442641147245489;'/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 461 ms.
Running link step : cd /tmp/ltsmin8268442641147245489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8268442641147245489;'/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/stateBased17546303614043517839.hoa' '--buchi-type=spotba'
LTSmin run took 414 ms.
FORMULA CO4-PT-07-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLCardinality-15 finished in 39784 ms.
All properties solved by simple procedures.
Total runtime 58148 ms.
BK_STOP 1717351501450
--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r550-tall-171734898400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-07.tgz
mv CO4-PT-07 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 ;