About the Execution of ITS-Tools for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3306.268 | 105561.00 | 252636.00 | 309.60 | TFFTTFTTFTFTTTFT | 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.r576-smll-171734920200175.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 MedleyA-PT-22, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200175
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 238K 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 MedleyA-PT-22-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717399813829
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-03 07:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 07:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 07:30:16] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2024-06-03 07:30:16] [INFO ] Transformed 307 places.
[2024-06-03 07:30:16] [INFO ] Transformed 740 transitions.
[2024-06-03 07:30:16] [INFO ] Found NUPN structural information;
[2024-06-03 07:30:16] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2024-06-03 07:30:17] [INFO ] Flatten gal took : 351 ms
[2024-06-03 07:30:18] [INFO ] Flatten gal took : 174 ms
RANDOM walk for 40000 steps (1165 resets) in 3816 ms. (10 steps per ms) remains 12/16 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 07:30:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality667344543401496234.gal : 96 ms
[2024-06-03 07:30:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7839989901610072363.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality667344543401496234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7839989901610072363.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40002 steps (227 resets) in 557 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (233 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality7839989901610072363.prop.
BEST_FIRST walk for 40003 steps (230 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (219 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (243 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 19
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 47
BEST_FIRST walk for 40004 steps (210 resets) in 799 ms. (50 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :47 after 403
BEST_FIRST walk for 40002 steps (239 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :403 after 1607
BEST_FIRST walk for 40003 steps (203 resets) in 641 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (201 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (208 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :1607 after 52703
BEST_FIRST walk for 40004 steps (240 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (190 resets) in 465 ms. (85 steps per ms) remains 12/12 properties
Reachability property MedleyA-PT-22-ReachabilityFireability-2024-07 is true.
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :52703 after 54502
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :54502 after 57198
// Phase 1: matrix 740 rows 307 cols
[2024-06-03 07:30:19] [INFO ] Computed 24 invariants in 51 ms
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :57198 after 77178
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :77178 after 105863
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-22-ReachabilityFireability-2024-10 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 140/225 variables, 10/95 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 140/235 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 82/307 variables, 14/249 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 82/331 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 3 solved, 8 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :105863 after 294720
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 638 constraints, problems are : Problem set: 3 solved, 8 unsolved in 1506 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-15 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 152/219 variables, 10/77 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 152/229 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/229 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 88/307 variables, 14/243 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 88/331 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 6/644 constraints. Problems are: Problem set: 5 solved, 6 unsolved
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :294720 after 950341
At refinement iteration 10 (INCLUDED_ONLY) 0/1047 variables, 0/644 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1047 variables, 0/644 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 644 constraints, problems are : Problem set: 5 solved, 6 unsolved in 3894 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 6066ms problems are : Problem set: 5 solved, 6 unsolved
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3713 ms.
Support contains 21 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 300 transition count 708
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 272 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 271 transition count 704
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 63 place count 271 transition count 697
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 264 transition count 697
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 162 place count 179 transition count 594
Iterating global reduction 3 with 85 rules applied. Total rules applied 247 place count 179 transition count 594
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 253 place count 179 transition count 588
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 277 place count 155 transition count 529
Iterating global reduction 4 with 24 rules applied. Total rules applied 301 place count 155 transition count 529
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 311 place count 145 transition count 504
Iterating global reduction 4 with 10 rules applied. Total rules applied 321 place count 145 transition count 504
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 326 place count 140 transition count 489
Iterating global reduction 4 with 5 rules applied. Total rules applied 331 place count 140 transition count 489
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 363 place count 124 transition count 473
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 365 place count 122 transition count 471
Iterating global reduction 4 with 2 rules applied. Total rules applied 367 place count 122 transition count 471
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 373 place count 119 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 384 place count 119 transition count 477
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 119 transition count 470
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 398 place count 112 transition count 470
Free-agglomeration rule (complex) applied 14 times with reduction of 8 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 412 place count 112 transition count 530
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 430 place count 98 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 436 place count 98 transition count 526
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 97 transition count 525
Applied a total of 437 rules in 308 ms. Remains 97 /307 variables (removed 210) and now considering 525/740 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 97/307 places, 525/740 transitions.
RANDOM walk for 40000 steps (2462 resets) in 453 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (338 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (315 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (428 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (278 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (406 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :950341 after 3.81368e+06
Interrupted probabilistic random walk after 520731 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 5
Probabilistic random walk after 520731 steps, saw 100803 distinct states, run finished after 3006 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 525 rows 97 cols
[2024-06-03 07:30:32] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 07:30:32] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/84 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 519/603 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 108/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 19/622 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/622 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 232 constraints, problems are : Problem set: 0 solved, 5 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/84 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 519/603 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 108/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 19/622 variables, 13/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/622 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 237 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2223ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3396 ms.
Support contains 17 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 525/525 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 97 transition count 524
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 96 transition count 524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 95 transition count 523
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 95 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 94 transition count 522
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 94 transition count 521
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 92 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 92 transition count 519
Applied a total of 12 rules in 72 ms. Remains 92 /97 variables (removed 5) and now considering 519/525 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 92/97 places, 519/525 transitions.
RANDOM walk for 40000 steps (2587 resets) in 319 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (484 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (310 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (470 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 404977 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 3
Probabilistic random walk after 404977 steps, saw 80618 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 519 rows 92 cols
[2024-06-03 07:30:41] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 07:30:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/75 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 513/592 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 108/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/611 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/611 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 227 constraints, problems are : Problem set: 0 solved, 3 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 92/92 constraints, ReadFeed: 112/112 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/75 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 513/592 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 108/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/592 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 19/611 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/611 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/611 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/611 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 230 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 92/92 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1788ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 896 ms.
Support contains 15 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 519/519 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 90 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 90 transition count 511
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 90 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 88 transition count 582
Applied a total of 8 rules in 54 ms. Remains 88 /92 variables (removed 4) and now considering 582/519 (removed -63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 88/92 places, 582/519 transitions.
RANDOM walk for 40000 steps (2712 resets) in 363 ms. (109 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (346 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
// Phase 1: matrix 582 rows 88 cols
[2024-06-03 07:30:44] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 07:30:44] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 45/71 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 576/651 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 108/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/670 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/670 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 88/88 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/71 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/73 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 576/651 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 108/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/670 variables, 13/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/670 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/670 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 88/88 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 13 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 582/582 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 581
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 87 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 628
Applied a total of 4 rules in 33 ms. Remains 86 /88 variables (removed 2) and now considering 628/582 (removed -46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 86/88 places, 628/582 transitions.
RANDOM walk for 40000 steps (2762 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (358 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 860776 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 1
Probabilistic random walk after 860776 steps, saw 170714 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
// Phase 1: matrix 628 rows 86 cols
[2024-06-03 07:30:48] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 07:30:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/67 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 622/695 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/695 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/714 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/67 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 622/695 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/695 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/714 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/714 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/714 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 13 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 86/86 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-06-03 07:30:50] [INFO ] Invariant cache hit.
[2024-06-03 07:30:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-03 07:30:50] [INFO ] Invariant cache hit.
[2024-06-03 07:30:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-03 07:30:50] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-06-03 07:30:50] [INFO ] Redundant transitions in 54 ms returned []
Running 621 sub problems to find dead transitions.
[2024-06-03 07:30:50] [INFO ] Invariant cache hit.
[2024-06-03 07:30:50] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :3.81368e+06 after 2.90918e+07
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 24 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/16 constraints. Problems are: Problem set: 24 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 24 solved, 597 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/83 variables, 4/20 constraints. Problems are: Problem set: 72 solved, 549 unsolved
[2024-06-03 07:31:00] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 72 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 72 solved, 549 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 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 TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/86 variables, 3/24 constraints. Problems are: Problem set: 144 solved, 477 unsolved
[2024-06-03 07:31:06] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-03 07:31:06] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-06-03 07:31:06] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-06-03 07:31:07] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
[2024-06-03 07:31:08] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 5/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 9 (OVERLAPS) 628/714 variables, 86/115 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 112/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 0/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 12 (OVERLAPS) 0/714 variables, 0/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 227 constraints, problems are : Problem set: 174 solved, 447 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 174 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/16 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/17 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 2/83 variables, 4/21 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/22 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/22 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 3/86 variables, 3/25 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 4/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 10 (OVERLAPS) 628/714 variables, 86/115 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 112/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
Reachability property MedleyA-PT-22-ReachabilityFireability-2024-03 is true.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :2.90918e+07 after 7.19779e+07
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 447/674 constraints. Problems are: Problem set: 174 solved, 447 unsolved
[2024-06-03 07:31:44] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 5 ms to minimize.
[2024-06-03 07:31:45] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 676 constraints, problems are : Problem set: 174 solved, 447 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 447/621 constraints, Known Traps: 8/8 constraints]
After SMT, in 63997ms problems are : Problem set: 174 solved, 447 unsolved
Search for dead transitions found 174 dead transitions in 64019ms
Found 174 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 174 transitions
Dead transitions reduction (with SMT) removed 174 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/86 places, 454/628 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 454
Applied a total of 1 rules in 12 ms. Remains 85 /86 variables (removed 1) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 85 cols
[2024-06-03 07:31:54] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 07:31:54] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-03 07:31:54] [INFO ] Invariant cache hit.
[2024-06-03 07:31:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 07:31:55] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/86 places, 454/628 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65213 ms. Remains : 85/86 places, 454/628 transitions.
RANDOM walk for 40000 steps (2747 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (356 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1060121 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 1
Probabilistic random walk after 1060121 steps, saw 211524 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
[2024-06-03 07:31:58] [INFO ] Invariant cache hit.
[2024-06-03 07:31:58] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/45 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/70 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/520 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/539 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/539 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/45 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/70 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/520 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/539 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/539 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/539 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1332 steps, including 42 resets, run visited all 1 properties in 11 ms. (steps per millisecond=121 )
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 103127 ms.
BK_STOP 1717399919390
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="MedleyA-PT-22"
export BK_EXAMINATION="ReachabilityFireability"
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 MedleyA-PT-22, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920200175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;