MCC'2024- Execution of r004-smll-171620117800071

About the Execution of ITS-Tools for ASLink-PT-04b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2930.827	3367831.00	6757412.00	6789.20	TTFFFTTFFTFFTTTF	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.r004-smll-171620117800071.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 ASLink-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117800071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 669K May 18 16:42 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 ASLink-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-07
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-14
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716264385800

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 04:06:27] [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-05-21 04:06:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:06:28] [INFO ] Load time of PNML (sax parser for PT used): 435 ms
[2024-05-21 04:06:28] [INFO ] Transformed 2034 places.
[2024-05-21 04:06:28] [INFO ] Transformed 2567 transitions.
[2024-05-21 04:06:28] [INFO ] Found NUPN structural information;
[2024-05-21 04:06:28] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 633 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (91 resets) in 3107 ms. (12 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 507 ms. (78 steps per ms) remains 12/12 properties
[2024-05-21 04:06:29] [INFO ] Flatten gal took : 741 ms
BEST_FIRST walk for 40004 steps (18 resets) in 1243 ms. (32 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (14 resets) in 274 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 331 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (12 resets) in 253 ms. (157 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 356 ms. (112 steps per ms) remains 12/12 properties
[2024-05-21 04:06:30] [INFO ] Flatten gal took : 406 ms
BEST_FIRST walk for 40004 steps (12 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (14 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
[2024-05-21 04:06:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18048850034733506267.gal : 195 ms
BEST_FIRST walk for 40003 steps (14 resets) in 367 ms. (108 steps per ms) remains 12/12 properties
[2024-05-21 04:06:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12735802137322145878.prop : 15 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/ReachabilityCardinality18048850034733506267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12735802137322145878.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (11 resets) in 338 ms. (118 steps per ms) remains 12/12 properties

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 ...330
BEST_FIRST walk for 40003 steps (13 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-21 04:06:31] [INFO ] Computed 199 invariants in 153 ms
Loading property file /tmp/ReachabilityCardinality12735802137322145878.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 403/691 variables, 40/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 403/731 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 74/765 variables, 8/740 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 74/814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2023-07 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1248/2013 variables, 147/961 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2013 variables, 1248/2209 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2013 variables, 0/2209 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 21/2034 variables, 3/2212 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2034 variables, 21/2233 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2034 variables, 0/2233 constraints. Problems are: Problem set: 1 solved, 11 unsolved
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 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :16 after 49
SMT process timed out in 5654ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 255 out of 2034 places. Attempting structural reductions.
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :49 after 196
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :196 after 416
Drop transitions (Trivial Post-Agglo cleanup.) removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 2034 transition count 2240
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :416 after 569
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 333 rules applied. Total rules applied 660 place count 1707 transition count 2234
Reduce places removed 1 places and 0 transitions.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :569 after 15361
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 46 rules applied. Total rules applied 706 place count 1706 transition count 2189
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 55 rules applied. Total rules applied 761 place count 1661 transition count 2179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 763 place count 1659 transition count 2179
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 386 Pre rules applied. Total rules applied 763 place count 1659 transition count 1793
Deduced a syphon composed of 386 places in 16 ms
Ensure Unique test removed 30 places
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 5 with 802 rules applied. Total rules applied 1565 place count 1243 transition count 1793
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 5 with 24 rules applied. Total rules applied 1589 place count 1236 transition count 1776
Reduce places removed 17 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 22 rules applied. Total rules applied 1611 place count 1219 transition count 1771
SDD proceeding with computation,12 properties remain. new max is 1024
Reduce places removed 5 places and 0 transitions.
SDD size :15361 after 618139
Iterating post reduction 7 with 5 rules applied. Total rules applied 1616 place count 1214 transition count 1771
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 1616 place count 1214 transition count 1762
Deduced a syphon composed of 9 places in 7 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1638 place count 1201 transition count 1762
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 1638 place count 1201 transition count 1758
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1646 place count 1197 transition count 1758
Discarding 52 places :
Symmetric choice reduction at 8 with 52 rule applications. Total rules 1698 place count 1145 transition count 1706
Iterating global reduction 8 with 52 rules applied. Total rules applied 1750 place count 1145 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1751 place count 1145 transition count 1705
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1751 place count 1145 transition count 1693
Deduced a syphon composed of 12 places in 4 ms
SDD proceeding with computation,12 properties remain. new max is 2048
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1775 place count 1133 transition count 1693
SDD size :618139 after 5.45975e+08
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1777 place count 1131 transition count 1678
Iterating global reduction 9 with 2 rules applied. Total rules applied 1779 place count 1131 transition count 1678
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1779 place count 1131 transition count 1677
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1781 place count 1130 transition count 1677
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 9 with 187 rules applied. Total rules applied 1968 place count 1036 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1969 place count 1035 transition count 1583
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 1971 place count 1034 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1973 place count 1033 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1975 place count 1033 transition count 1590
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 1977 place count 1032 transition count 1589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1978 place count 1031 transition count 1589
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1990 place count 1031 transition count 1577
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 2002 place count 1019 transition count 1577
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 2007 place count 1019 transition count 1572
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2012 place count 1014 transition count 1572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2013 place count 1013 transition count 1571
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 2016 place count 1011 transition count 1570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2017 place count 1010 transition count 1570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 2 Pre rules applied. Total rules applied 2017 place count 1010 transition count 1568
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2021 place count 1008 transition count 1568
SDD proceeding with computation,12 properties remain. new max is 4096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
SDD size :5.45975e+08 after 3.89853e+11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2023 place count 1007 transition count 1567
Applied a total of 2023 rules in 1528 ms. Remains 1007 /2034 variables (removed 1027) and now considering 1567/2567 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1555 ms. Remains : 1007/2034 places, 1567/2567 transitions.
RANDOM walk for 40000 steps (208 resets) in 746 ms. (53 steps per ms) remains 10/11 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (34 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 393 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (39 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (39 resets) in 347 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (39 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
Interrupted probabilistic random walk after 160067 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 10
Probabilistic random walk after 160067 steps, saw 36425 distinct states, run finished after 3007 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 1567 rows 1007 cols
[2024-05-21 04:06:42] [INFO ] Computed 153 invariants in 112 ms
[2024-05-21 04:06:42] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 236/463 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/476 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 514/990 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/990 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 17/1007 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1007 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1567/2574 variables, 1007/1160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2574 variables, 10/1170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2574 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2574 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2574/2574 variables, and 1170 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6689 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 116/116 constraints, State Equation: 1007/1007 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 236/463 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 04:06:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 04:06:50] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 1/37 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 04:06:50] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 13/476 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 04:06:50] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 514/990 variables, 112/154 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-21 04:06:51] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-21 04:06:51] [INFO ] Deduced a trap composed of 146 places in 465 ms of which 6 ms to minimize.
[2024-05-21 04:06:52] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-05-21 04:06:52] [INFO ] Deduced a trap composed of 109 places in 602 ms of which 8 ms to minimize.
[2024-05-21 04:06:53] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 4 ms to minimize.
[2024-05-21 04:06:53] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/990 variables, 6/160 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-21 04:06:53] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 1/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 17/1007 variables, 3/164 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-21 04:06:54] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-21 04:06:54] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 3 ms to minimize.
[2024-05-21 04:06:55] [INFO ] Deduced a trap composed of 153 places in 635 ms of which 8 ms to minimize.
[2024-05-21 04:06:56] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 4 ms to minimize.
[2024-05-21 04:06:56] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 3 ms to minimize.
[2024-05-21 04:06:56] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 3 ms to minimize.
[2024-05-21 04:06:56] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1007 variables, 7/171 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1007 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (OVERLAPS) 1567/2574 variables, 1007/1178 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2024-02 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/2574 variables, 10/1188 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2574/2574 variables, and 1193 constraints, problems are : Problem set: 5 solved, 5 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 116/116 constraints, State Equation: 1007/1007 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 18/18 constraints]
After SMT, in 52224ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 1567/1567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1007 transition count 1544
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 984 transition count 1541
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 981 transition count 1541
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 52 place count 981 transition count 1474
Deduced a syphon composed of 67 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 193 place count 907 transition count 1474
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 907 transition count 1473
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 905 transition count 1473
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 196 place count 905 transition count 1467
Deduced a syphon composed of 6 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 210 place count 897 transition count 1467
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 896 transition count 1467
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 215 place count 892 transition count 1453
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 892 transition count 1453
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 219 place count 892 transition count 1452
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 891 transition count 1452
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 259 place count 872 transition count 1433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 871 transition count 1432
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 265 place count 871 transition count 1428
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 270 place count 867 transition count 1427
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 273 place count 867 transition count 1424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 276 place count 864 transition count 1424
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 280 place count 860 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 281 place count 859 transition count 1420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 281 place count 859 transition count 1418
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 285 place count 857 transition count 1418
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 286 place count 856 transition count 1418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 290 place count 854 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 291 place count 853 transition count 1415
Iterating global reduction 10 with 1 rules applied. Total rules applied 292 place count 853 transition count 1415
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 293 place count 852 transition count 1414
Iterating global reduction 10 with 1 rules applied. Total rules applied 294 place count 852 transition count 1414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 295 place count 852 transition count 1413
Applied a total of 295 rules in 367 ms. Remains 852 /1007 variables (removed 155) and now considering 1413/1567 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 852/1007 places, 1413/1567 transitions.
RANDOM walk for 40000 steps (303 resets) in 515 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (73 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (64 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 223481 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 5
Probabilistic random walk after 223481 steps, saw 47961 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1413 rows 852 cols
[2024-05-21 04:07:38] [INFO ] Computed 140 invariants in 19 ms
[2024-05-21 04:07:38] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 199/323 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/340 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 492/832 variables, 104/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/834 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 18/852 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/852 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1413/2265 variables, 852/992 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2265 variables, 10/1002 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2265 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2265 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2265/2265 variables, and 1002 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2709 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 852/852 constraints, ReadFeed: 10/10 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 199/323 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/340 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:07:41] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 2 ms to minimize.
[2024-05-21 04:07:41] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 492/832 variables, 104/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:07:41] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-21 04:07:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:07:42] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/834 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/834 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 18/852 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/852 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1413/2265 variables, 852/997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2265 variables, 10/1007 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2265 variables, 5/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:08:18] [INFO ] Deduced a trap composed of 11 places in 618 ms of which 7 ms to minimize.
[2024-05-21 04:08:18] [INFO ] Deduced a trap composed of 50 places in 620 ms of which 7 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2265 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 04:08:33] [INFO ] Deduced a trap composed of 94 places in 450 ms of which 5 ms to minimize.
[2024-05-21 04:08:33] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 3 ms to minimize.
[2024-05-21 04:08:34] [INFO ] Deduced a trap composed of 88 places in 555 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2265 variables, 3/1017 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2265/2265 variables, and 1017 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 852/852 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 77810ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 852/852 places, 1413/1413 transitions.
Applied a total of 0 rules in 47 ms. Remains 852 /852 variables (removed 0) and now considering 1413/1413 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 852/852 places, 1413/1413 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 852/852 places, 1413/1413 transitions.
Applied a total of 0 rules in 39 ms. Remains 852 /852 variables (removed 0) and now considering 1413/1413 (removed 0) transitions.
[2024-05-21 04:08:56] [INFO ] Invariant cache hit.
[2024-05-21 04:08:56] [INFO ] Implicit Places using invariants in 768 ms returned [29, 46, 140, 144, 155, 169, 170, 181, 197, 199, 225, 243, 266, 336, 352, 353, 359, 376, 394, 449, 486, 491, 492, 503, 504, 509, 530, 549, 616, 619, 630, 631, 650, 664, 665, 666, 709, 713, 733, 736, 755, 767, 773, 779, 785, 792, 804, 810, 816]
[2024-05-21 04:08:56] [INFO ] Actually due to overlaps returned [225, 359, 376, 509, 530, 713, 46, 503, 665, 666, 199, 504, 709, 733, 336, 491, 492, 197, 353, 394, 549, 664, 785, 804, 29, 181, 243, 266, 352, 616, 630, 650, 736, 755, 767, 773, 779, 792, 810, 816]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 782 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 812/852 places, 1413/1413 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 809 transition count 1381
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 48 rules applied. Total rules applied 83 place count 777 transition count 1365
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 99 place count 761 transition count 1365
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 99 place count 761 transition count 1356
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 117 place count 752 transition count 1356
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 121 place count 750 transition count 1354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 748 transition count 1354
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 129 place count 742 transition count 1348
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 742 transition count 1348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 135 place count 742 transition count 1347
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 741 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 740 transition count 1346
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 740 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 739 transition count 1344
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 739 transition count 1344
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 197 place count 711 transition count 1316
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 199 place count 709 transition count 1314
Iterating global reduction 5 with 2 rules applied. Total rules applied 201 place count 709 transition count 1314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 709 transition count 1313
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 709 transition count 1312
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 205 place count 708 transition count 1311
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 216 place count 708 transition count 1300
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 227 place count 697 transition count 1300
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 228 place count 697 transition count 1299
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 238 place count 697 transition count 1299
Applied a total of 238 rules in 477 ms. Remains 697 /812 variables (removed 115) and now considering 1299/1413 (removed 114) transitions.
// Phase 1: matrix 1299 rows 697 cols
[2024-05-21 04:08:57] [INFO ] Computed 95 invariants in 15 ms
[2024-05-21 04:08:57] [INFO ] Implicit Places using invariants in 543 ms returned [132, 136, 158, 159, 168, 289, 312, 313, 314, 401, 404, 491, 523, 526, 532]
[2024-05-21 04:08:57] [INFO ] Actually due to overlaps returned [313, 314, 401, 132, 158, 168, 289, 312, 404, 491, 523, 526, 532]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 546 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 684/852 places, 1299/1413 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 682 transition count 1297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 680 transition count 1297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 678 transition count 1295
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 678 transition count 1294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 677 transition count 1294
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 677 transition count 1292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 675 transition count 1292
Applied a total of 16 rules in 442 ms. Remains 675 /684 variables (removed 9) and now considering 1292/1299 (removed 7) transitions.
// Phase 1: matrix 1292 rows 675 cols
[2024-05-21 04:08:58] [INFO ] Computed 80 invariants in 15 ms
[2024-05-21 04:08:58] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-21 04:08:58] [INFO ] Invariant cache hit.
[2024-05-21 04:08:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 04:09:01] [INFO ] Implicit Places using invariants and state equation in 2827 ms returned []
Implicit Place search using SMT with State Equation took 3338 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 675/852 places, 1292/1413 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5627 ms. Remains : 675/852 places, 1292/1413 transitions.
RANDOM walk for 40000 steps (366 resets) in 315 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (74 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (84 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (73 resets) in 105 ms. (377 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 04:09:02] [INFO ] Invariant cache hit.
[2024-05-21 04:09:02] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/288 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/310 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 364/674 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/675 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1292/1967 variables, 675/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 7/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1967 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1967 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 762 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2637 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 675/675 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/288 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/310 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 364/674 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:09:05] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-05-21 04:09:05] [INFO ] Deduced a trap composed of 114 places in 355 ms of which 5 ms to minimize.
[2024-05-21 04:09:06] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:09:06] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/675 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1292/1967 variables, 675/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1967 variables, 7/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1967 variables, 4/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:09:50] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 5 ms to minimize.
[2024-05-21 04:09:51] [INFO ] Deduced a trap composed of 39 places in 427 ms of which 6 ms to minimize.
[2024-05-21 04:09:56] [INFO ] Deduced a trap composed of 37 places in 482 ms of which 5 ms to minimize.
[2024-05-21 04:09:56] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-05-21 04:10:02] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1967 variables, 5/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:05] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1967 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:17] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1967 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:21] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1967 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1967/1967 variables, and 778 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90043 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 675/675 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 92761ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1292/1292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 675 transition count 1291
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 674 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 672 transition count 1289
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6 place count 672 transition count 1284
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16 place count 667 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 666 transition count 1283
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 666 transition count 1283
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 663 transition count 1280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 663 transition count 1279
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 663 transition count 1278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 662 transition count 1278
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 662 transition count 1277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 661 transition count 1277
Applied a total of 29 rules in 210 ms. Remains 661 /675 variables (removed 14) and now considering 1277/1292 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 661/675 places, 1277/1292 transitions.
RANDOM walk for 40000 steps (368 resets) in 751 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (93 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (83 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (80 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 189144 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 189144 steps, saw 43981 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1277 rows 661 cols
[2024-05-21 04:10:38] [INFO ] Computed 80 invariants in 24 ms
[2024-05-21 04:10:38] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/319 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/329 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 331/660 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/661 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1277/1938 variables, 661/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1938 variables, 7/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1938 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1938 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1938/1938 variables, and 748 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2337 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/319 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:41] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 10/329 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 331/660 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:42] [INFO ] Deduced a trap composed of 58 places in 654 ms of which 8 ms to minimize.
[2024-05-21 04:10:42] [INFO ] Deduced a trap composed of 9 places in 515 ms of which 8 ms to minimize.
[2024-05-21 04:10:43] [INFO ] Deduced a trap composed of 55 places in 505 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/661 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:10:43] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1277/1938 variables, 661/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1938 variables, 7/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1938 variables, 4/757 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 87 places in 539 ms of which 8 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 85 places in 543 ms of which 8 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 88 places in 518 ms of which 7 ms to minimize.
[2024-05-21 04:11:04] [INFO ] Deduced a trap composed of 85 places in 521 ms of which 7 ms to minimize.
[2024-05-21 04:11:04] [INFO ] Deduced a trap composed of 59 places in 441 ms of which 6 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 58 places in 440 ms of which 8 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 56 places in 433 ms of which 6 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 6 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 58 places in 429 ms of which 7 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 5 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 80 places in 360 ms of which 19 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 101 places in 336 ms of which 4 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 16 places in 309 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1938 variables, 14/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1938 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:11:39] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1938 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1938 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1938 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1938/1938 variables, and 772 constraints, problems are : Problem set: 0 solved, 4 unsolved in 100298 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 102704ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 36836 ms.
Support contains 111 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1277/1277 transitions.
Applied a total of 0 rules in 21 ms. Remains 661 /661 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 661/661 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1277/1277 transitions.
Applied a total of 0 rules in 18 ms. Remains 661 /661 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2024-05-21 04:12:58] [INFO ] Invariant cache hit.
[2024-05-21 04:12:59] [INFO ] Implicit Places using invariants in 672 ms returned [60, 78, 168, 393, 625]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 679 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 656/661 places, 1277/1277 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 656 transition count 1273
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 652 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 651 transition count 1272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 651 transition count 1271
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 650 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 649 transition count 1270
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 649 transition count 1270
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 645 transition count 1266
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 645 transition count 1264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 643 transition count 1264
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 643 transition count 1264
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 643 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 642 transition count 1263
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 642 transition count 1263
Applied a total of 34 rules in 124 ms. Remains 642 /656 variables (removed 14) and now considering 1263/1277 (removed 14) transitions.
// Phase 1: matrix 1263 rows 642 cols
[2024-05-21 04:12:59] [INFO ] Computed 75 invariants in 18 ms
[2024-05-21 04:12:59] [INFO ] Implicit Places using invariants in 635 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 642 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 641/661 places, 1263/1277 transitions.
Applied a total of 0 rules in 19 ms. Remains 641 /641 variables (removed 0) and now considering 1263/1263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1486 ms. Remains : 641/661 places, 1263/1277 transitions.
RANDOM walk for 40000 steps (366 resets) in 654 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (91 resets) in 494 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (91 resets) in 464 ms. (86 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 285219 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :1 out of 4
Probabilistic random walk after 285219 steps, saw 61387 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :1
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1263 rows 641 cols
[2024-05-21 04:13:03] [INFO ] Computed 74 invariants in 17 ms
[2024-05-21 04:13:03] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 217/308 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/317 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/640 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/641 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1263/1904 variables, 641/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1904 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 722 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1827 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 641/641 constraints, ReadFeed: 7/7 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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 217/308 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/317 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/640 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:06] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-05-21 04:13:06] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:06] [INFO ] Deduced a trap composed of 25 places in 573 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/641 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1263/1904 variables, 641/718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1904 variables, 7/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1904 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:11] [INFO ] Deduced a trap composed of 47 places in 507 ms of which 7 ms to minimize.
[2024-05-21 04:13:12] [INFO ] Deduced a trap composed of 66 places in 538 ms of which 5 ms to minimize.
[2024-05-21 04:13:12] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 4 ms to minimize.
[2024-05-21 04:13:13] [INFO ] Deduced a trap composed of 47 places in 373 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1904 variables, 4/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:23] [INFO ] Deduced a trap composed of 70 places in 435 ms of which 5 ms to minimize.
[2024-05-21 04:13:24] [INFO ] Deduced a trap composed of 106 places in 382 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1904 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1904 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1904 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 734 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26504 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 641/641 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 28394ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18286 ms.
Support contains 91 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1263/1263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 641 transition count 1261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 639 transition count 1261
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4 place count 639 transition count 1251
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 629 transition count 1251
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 627 transition count 1244
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 627 transition count 1244
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 622 transition count 1239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 621 transition count 1238
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 621 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 620 transition count 1236
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 620 transition count 1236
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 620 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 619 transition count 1235
Applied a total of 44 rules in 94 ms. Remains 619 /641 variables (removed 22) and now considering 1235/1263 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 619/641 places, 1235/1263 transitions.
RANDOM walk for 40000 steps (378 resets) in 774 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 489 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (89 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (94 resets) in 449 ms. (88 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227207 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227207 steps, saw 47569 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1235 rows 619 cols
[2024-05-21 04:13:54] [INFO ] Computed 74 invariants in 13 ms
[2024-05-21 04:13:54] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/251 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/260 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 358/618 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/619 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1235/1854 variables, 619/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1854 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1854 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1854 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1854/1854 variables, and 701 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 619/619 constraints, ReadFeed: 8/8 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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/251 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/260 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:55] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 04:13:55] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-21 04:13:56] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 358/618 variables, 55/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:56] [INFO ] Deduced a trap composed of 59 places in 663 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/619 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:13:57] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1235/1854 variables, 619/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1854 variables, 8/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1854 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1854 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1854 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1854/1854 variables, and 709 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21267 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 619/619 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 22728ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 17440 ms.
Support contains 91 out of 619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 619/619 places, 1235/1235 transitions.
Applied a total of 0 rules in 17 ms. Remains 619 /619 variables (removed 0) and now considering 1235/1235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 619/619 places, 1235/1235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 619/619 places, 1235/1235 transitions.
Applied a total of 0 rules in 15 ms. Remains 619 /619 variables (removed 0) and now considering 1235/1235 (removed 0) transitions.
[2024-05-21 04:14:34] [INFO ] Invariant cache hit.
[2024-05-21 04:14:35] [INFO ] Implicit Places using invariants in 746 ms returned [152, 472]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 749 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 617/619 places, 1235/1235 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 617 transition count 1233
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 615 transition count 1231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 613 transition count 1231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 611 transition count 1229
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 611 transition count 1227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 609 transition count 1227
Applied a total of 16 rules in 108 ms. Remains 609 /617 variables (removed 8) and now considering 1227/1235 (removed 8) transitions.
// Phase 1: matrix 1227 rows 609 cols
[2024-05-21 04:14:35] [INFO ] Computed 72 invariants in 12 ms
[2024-05-21 04:14:35] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-21 04:14:35] [INFO ] Invariant cache hit.
[2024-05-21 04:14:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 04:14:37] [INFO ] Implicit Places using invariants and state equation in 2193 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 609/619 places, 1227/1235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3615 ms. Remains : 609/619 places, 1227/1235 transitions.
RANDOM walk for 40000 steps (405 resets) in 767 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (97 resets) in 342 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (107 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 192250 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 3
Probabilistic random walk after 192250 steps, saw 40721 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-21 04:14:41] [INFO ] Invariant cache hit.
[2024-05-21 04:14:41] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/256 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 352/608 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/609 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1227/1836 variables, 609/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1836 variables, 9/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1836 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1836 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1836/1836 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 609/609 constraints, ReadFeed: 9/9 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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:14:43] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/256 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:14:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 04:14:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 04:14:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 352/608 variables, 54/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:14:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:14:44] [INFO ] Deduced a trap composed of 57 places in 454 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/609 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:14:45] [INFO ] Deduced a trap composed of 56 places in 479 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1227/1836 variables, 609/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1836 variables, 9/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1836 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:15:11] [INFO ] Deduced a trap composed of 47 places in 605 ms of which 7 ms to minimize.
[2024-05-21 04:15:12] [INFO ] Deduced a trap composed of 35 places in 462 ms of which 6 ms to minimize.
[2024-05-21 04:15:12] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1836 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1836 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 04:15:21] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 4 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1836 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1836 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1836 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1836/1836 variables, and 704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49416 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 609/609 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 51037ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 25697 ms.
Support contains 91 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1227/1227 transitions.
Applied a total of 0 rules in 21 ms. Remains 609 /609 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 609/609 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1227/1227 transitions.
Applied a total of 0 rules in 27 ms. Remains 609 /609 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-05-21 04:15:58] [INFO ] Invariant cache hit.
[2024-05-21 04:15:59] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-21 04:15:59] [INFO ] Invariant cache hit.
[2024-05-21 04:16:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 04:16:01] [INFO ] Implicit Places using invariants and state equation in 2385 ms returned []
Implicit Place search using SMT with State Equation took 3264 ms to find 0 implicit places.
[2024-05-21 04:16:01] [INFO ] Redundant transitions in 163 ms returned []
Running 1209 sub problems to find dead transitions.
[2024-05-21 04:16:01] [INFO ] Invariant cache hit.
[2024-05-21 04:16:01] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
[2024-05-21 04:16:24] [INFO ] Deduced a trap composed of 44 places in 1393 ms of which 2 ms to minimize.
[2024-05-21 04:16:24] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-21 04:16:25] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/1836 variables, and 49 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/17 constraints, Generalized P Invariants (flows): 41/55 constraints, State Equation: 0/609 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1209/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
[2024-05-21 04:16:45] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 2 ms to minimize.
[2024-05-21 04:16:53] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
[2024-05-21 04:16:56] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 3 ms to minimize.
[2024-05-21 04:16:56] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/1836 variables, and 53 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/17 constraints, Generalized P Invariants (flows): 41/55 constraints, State Equation: 0/609 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1209 constraints, Known Traps: 7/7 constraints]
After SMT, in 61442ms problems are : Problem set: 0 solved, 1209 unsolved
Search for dead transitions found 0 dead transitions in 61479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64953 ms. Remains : 609/609 places, 1227/1227 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2883 edges and 609 vertex of which 608 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 608 transition count 1221
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 14 place count 601 transition count 1221
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 597 transition count 1221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 594 transition count 1218
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 594 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 591 transition count 1215
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 591 transition count 1215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 588 transition count 1212
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 588 transition count 1212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 588 transition count 1210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 587 transition count 1209
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 41 place count 587 transition count 1208
Applied a total of 41 rules in 148 ms. Remains 587 /609 variables (removed 22) and now considering 1208/1227 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1208 rows 587 cols
[2024-05-21 04:17:03] [INFO ] Computed 66 invariants in 17 ms
[2024-05-21 04:17:04] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 04:17:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-21 04:17:04] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 46 ms returned sat
[2024-05-21 04:17:10] [INFO ] After 6634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 04:17:11] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 5 ms to minimize.
[2024-05-21 04:17:13] [INFO ] Deduced a trap composed of 38 places in 1657 ms of which 2 ms to minimize.
[2024-05-21 04:17:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2184 ms
[2024-05-21 04:17:14] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-21 04:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
TRAPS : Iteration 1
[2024-05-21 04:17:42] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 6 ms to minimize.
[2024-05-21 04:17:43] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 4 ms to minimize.
[2024-05-21 04:17:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1667 ms
TRAPS : Iteration 2
[2024-05-21 04:17:45] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 4 ms to minimize.
[2024-05-21 04:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-05-21 04:17:48] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-21 04:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
TRAPS : Iteration 3
[2024-05-21 04:17:49] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 7 ms to minimize.
[2024-05-21 04:17:49] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 3 ms to minimize.
[2024-05-21 04:17:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1115 ms
TRAPS : Iteration 4
[2024-05-21 04:17:58] [INFO ] Deduced a trap composed of 70 places in 291 ms of which 4 ms to minimize.
[2024-05-21 04:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1279 ms
TRAPS : Iteration 5
[2024-05-21 04:18:09] [INFO ] Deduced a trap composed of 77 places in 375 ms of which 6 ms to minimize.
[2024-05-21 04:18:10] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 5 ms to minimize.
[2024-05-21 04:18:10] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-21 04:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1161 ms
TRAPS : Iteration 6
[2024-05-21 04:18:14] [INFO ] After 69992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 04:18:25] [INFO ] After 81577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-21 04:18:25] [INFO ] Flatten gal took : 114 ms
[2024-05-21 04:18:25] [INFO ] Flatten gal took : 162 ms
[2024-05-21 04:18:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2328747405362170030.gal : 27 ms
[2024-05-21 04:18:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2035127688120586746.prop : 1 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/ReachabilityCardinality2328747405362170030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2035127688120586746.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 ...328
Loading property file /tmp/ReachabilityCardinality2035127688120586746.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 26
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :26 after 196
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :196 after 1340
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1340 after 406392
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :406392 after 2.293e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.293e+08 after 2.58756e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.58756e+08 after 2.97854e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.97854e+08 after 3.11141e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.11141e+08 after 2.98858e+09
Detected timeout of ITS tools.
[2024-05-21 04:18:41] [INFO ] Flatten gal took : 50 ms
[2024-05-21 04:18:41] [INFO ] Applying decomposition
[2024-05-21 04:18:41] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3469326919217773656.txt' '-o' '/tmp/graph3469326919217773656.bin' '-w' '/tmp/graph3469326919217773656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3469326919217773656.bin' '-l' '-1' '-v' '-w' '/tmp/graph3469326919217773656.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:18:41] [INFO ] Decomposing Gal with order
[2024-05-21 04:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:18:42] [INFO ] Removed a total of 2140 redundant transitions.
[2024-05-21 04:18:42] [INFO ] Flatten gal took : 244 ms
[2024-05-21 04:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 60 ms.
[2024-05-21 04:18:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4736833582684419008.gal : 37 ms
[2024-05-21 04:18:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6264707365535003313.prop : 1 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/ReachabilityCardinality4736833582684419008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6264707365535003313.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality6264707365535003313.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 26
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :26 after 1612
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1612 after 3304
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3304 after 1.08284e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.08284e+09 after 4.63637e+09
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4.63637e+09 after 8.80265e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.80265e+09 after 2.36658e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 114144 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 04:18:57] [INFO ] Flatten gal took : 83 ms
[2024-05-21 04:18:57] [INFO ] Applying decomposition
[2024-05-21 04:18:57] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14525804776908721494.txt' '-o' '/tmp/graph14525804776908721494.bin' '-w' '/tmp/graph14525804776908721494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14525804776908721494.bin' '-l' '-1' '-v' '-w' '/tmp/graph14525804776908721494.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:18:57] [INFO ] Decomposing Gal with order
[2024-05-21 04:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:18:58] [INFO ] Removed a total of 1940 redundant transitions.
[2024-05-21 04:18:58] [INFO ] Flatten gal took : 170 ms
[2024-05-21 04:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 69 ms.
[2024-05-21 04:18:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2864087265015161416.gal : 28 ms
[2024-05-21 04:18:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8711151536580949200.prop : 1 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/ReachabilityCardinality2864087265015161416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8711151536580949200.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality8711151536580949200.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 3.12841e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.12841e+09 after 2.28553e+22
Detected timeout of ITS tools.
[2024-05-21 04:48:58] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7850662447886378045
[2024-05-21 04:48:58] [INFO ] Applying decomposition
[2024-05-21 04:48:58] [INFO ] Computing symmetric may disable matrix : 1227 transitions.
[2024-05-21 04:48:58] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 04:48:58] [INFO ] Computing symmetric may enable matrix : 1227 transitions.
[2024-05-21 04:48:58] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 04:48:58] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16401219542438745801.txt' '-o' '/tmp/graph16401219542438745801.bin' '-w' '/tmp/graph16401219542438745801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16401219542438745801.bin' '-l' '-1' '-v' '-w' '/tmp/graph16401219542438745801.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:48:59] [INFO ] Decomposing Gal with order
[2024-05-21 04:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:48:59] [INFO ] Removed a total of 2138 redundant transitions.
[2024-05-21 04:48:59] [INFO ] Flatten gal took : 81 ms
[2024-05-21 04:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 17 ms.
[2024-05-21 04:48:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6823515202959140635.gal : 13 ms
[2024-05-21 04:48:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12944887827420261504.prop : 1 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/ReachabilityFireability6823515202959140635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12944887827420261504.prop' '--nowitness'

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 ...308
[2024-05-21 04:48:59] [INFO ] Computing Do-Not-Accords matrix : 1227 transitions.
[2024-05-21 04:48:59] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file /tmp/ReachabilityFireability12944887827420261504.prop.
[2024-05-21 04:48:59] [INFO ] Built C files in 692ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7850662447886378045
Running compilation step : cd /tmp/ltsmin7850662447886378045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 9912
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9912 after 8.90652e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.90058e+09 after 1.35932e+10
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.35932e+10 after 1.3663e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.3663e+10 after 3.30586e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.30586e+10 after 3.86517e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.86517e+10 after 6.69136e+11
Compilation finished in 8341 ms.
Running link step : cd /tmp/ltsmin7850662447886378045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 99 ms.
Running LTSmin : cd /tmp/ltsmin7850662447886378045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityFireability202303==true'
Reachability property ASLink-PT-04b-ReachabilityFireability-2023-14 is true.
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-04b-ReachabilityFireability-2024-04 does not hold.
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7850662447886378045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityFireability202303==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7850662447886378045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT04bReachabilityFireability202303==true'
Invariant property ASLink-PT-04b-ReachabilityFireability-2023-03 does not hold.
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.04388e+13,222.035,216760,9709,2435,293730,37375,2065,1.1575e+06,405,395870,0
Total reachable state count : 80438845050192

Verifying 3 reachability properties.
Invariant property ASLink-PT-04b-ReachabilityFireability-2023-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityFireability-2023-03,1.14227e+08,276.126,216760,1156,898,293730,37375,2288,1.1575e+06,426,395870,0
Invariant property ASLink-PT-04b-ReachabilityFireability-2024-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityFireability-2024-04,2.70725e+08,306.606,216760,1793,671,293730,37375,2340,1.1575e+06,428,395870,0
Reachability property ASLink-PT-04b-ReachabilityFireability-2023-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityFireability-2023-14,13600,367.402,216760,380,142,293730,37375,2478,1.1575e+06,438,395870,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3366025 ms.

BK_STOP 1716267753631

--------------------
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="ASLink-PT-04b"
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 ASLink-PT-04b, 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 r004-smll-171620117800071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;