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.r492-smll-171636266400201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 EisenbergMcGuire-PT-10-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717234309882

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:31:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:31:53] [INFO ] Load time of PNML (sax parser for PT used): 901 ms
[2024-06-01 09:31:53] [INFO ] Transformed 1090 places.
[2024-06-01 09:31:53] [INFO ] Transformed 5200 transitions.
[2024-06-01 09:31:53] [INFO ] Found NUPN structural information;
[2024-06-01 09:31:53] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 1006 transition count 4360
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 1006 transition count 4360
Applied a total of 168 rules in 242 ms. Remains 1006 /1090 variables (removed 84) and now considering 4360/5200 (removed 840) transitions.
[2024-06-01 09:31:54] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
// Phase 1: matrix 1490 rows 1006 cols
[2024-06-01 09:31:54] [INFO ] Computed 31 invariants in 49 ms
[2024-06-01 09:31:56] [INFO ] Implicit Places using invariants in 2308 ms returned []
[2024-06-01 09:31:56] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:31:56] [INFO ] Invariant cache hit.
[2024-06-01 09:31:57] [INFO ] State equation strengthened by 490 read => feed constraints.
[2024-06-01 09:32:11] [INFO ] Implicit Places using invariants and state equation in 14540 ms returned []
Implicit Place search using SMT with State Equation took 16912 ms to find 0 implicit places.
Running 4350 sub problems to find dead transitions.
[2024-06-01 09:32:11] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:32:11] [INFO ] Invariant cache hit.
[2024-06-01 09:32:11] [INFO ] State equation strengthened by 490 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4350 unsolved
SMT process timed out in 35638ms, After SMT, problems are : Problem set: 0 solved, 4350 unsolved
Search for dead transitions found 0 dead transitions in 35790ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1090 places, 4360/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53044 ms. Remains : 1006/1090 places, 4360/5200 transitions.
Support contains 102 out of 1006 places after structural reductions.
[2024-06-01 09:32:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 09:32:47] [INFO ] Flatten gal took : 501 ms
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 09:32:48] [INFO ] Flatten gal took : 255 ms
[2024-06-01 09:32:48] [INFO ] Input system was already deterministic with 4360 transitions.
Support contains 94 out of 1006 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2662 ms. (15 steps per ms) remains 19/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
[2024-06-01 09:32:49] [INFO ] Flow matrix only has 1490 transitions (discarded 2870 similar events)
[2024-06-01 09:32:49] [INFO ] Invariant cache hit.
[2024-06-01 09:32:49] [INFO ] State equation strengthened by 490 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 750/781 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 16/797 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1194/1991 variables, 797/821 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1991 variables, 184/1005 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1991 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 46/2037 variables, 10/1015 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2037 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2037 variables, 139/1155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2037 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 5119ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 296 Pre rules applied. Total rules applied 20 place count 996 transition count 4054
Deduced a syphon composed of 296 places in 8 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 612 place count 700 transition count 4054
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 616 place count 696 transition count 4014
Iterating global reduction 2 with 4 rules applied. Total rules applied 620 place count 696 transition count 4014
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 7 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 788 place count 612 transition count 3930
Applied a total of 788 rules in 854 ms. Remains 612 /1006 variables (removed 394) and now considering 3930/4360 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 612/1006 places, 3930/4360 transitions.
RANDOM walk for 40000 steps (8 resets) in 536 ms. (74 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
[2024-06-01 09:32:56] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
// Phase 1: matrix 1060 rows 612 cols
[2024-06-01 09:32:56] [INFO ] Computed 31 invariants in 14 ms
[2024-06-01 09:32:56] [INFO ] State equation strengthened by 454 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 386/414 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 14/428 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 754/1182 variables, 428/449 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1182 variables, 140/589 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1182 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 64/1246 variables, 10/599 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1246 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1246 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1246 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 78/1324 variables, 36/736 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 30/766 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 132/1456 variables, 6/772 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1456 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 6/1462 variables, 3/775 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1462 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 210/1672 variables, 138/913 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1672 variables, 184/1097 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1672 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1672 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 1097 constraints, problems are : Problem set: 0 solved, 17 unsolved in 6827 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 612/612 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 386/414 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 14/428 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:04] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 36 ms to minimize.
[2024-06-01 09:33:04] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 10 ms to minimize.
[2024-06-01 09:33:05] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 5 ms to minimize.
[2024-06-01 09:33:06] [INFO ] Deduced a trap composed of 55 places in 699 ms of which 12 ms to minimize.
[2024-06-01 09:33:06] [INFO ] Deduced a trap composed of 29 places in 590 ms of which 19 ms to minimize.
[2024-06-01 09:33:07] [INFO ] Deduced a trap composed of 56 places in 410 ms of which 5 ms to minimize.
[2024-06-01 09:33:07] [INFO ] Deduced a trap composed of 43 places in 482 ms of which 5 ms to minimize.
[2024-06-01 09:33:08] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 4 ms to minimize.
[2024-06-01 09:33:08] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:33:08] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 3 ms to minimize.
[2024-06-01 09:33:08] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
[2024-06-01 09:33:09] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 2 ms to minimize.
[2024-06-01 09:33:09] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-01 09:33:09] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 3 ms to minimize.
[2024-06-01 09:33:09] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:33:09] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-06-01 09:33:10] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:33:10] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 4 ms to minimize.
[2024-06-01 09:33:10] [INFO ] Deduced a trap composed of 18 places in 343 ms of which 4 ms to minimize.
[2024-06-01 09:33:11] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:11] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 4 ms to minimize.
[2024-06-01 09:33:11] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 3 ms to minimize.
[2024-06-01 09:33:12] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 2 ms to minimize.
[2024-06-01 09:33:12] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:13] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:13] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2024-06-01 09:33:14] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 754/1182 variables, 428/476 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1182 variables, 140/616 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:15] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1182 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1182 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 64/1246 variables, 10/627 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1246 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1246 variables, 100/728 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1246 variables, 3/731 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 78/1324 variables, 36/767 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 30/797 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:20] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1324 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 132/1456 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1456 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 6/1462 variables, 3/807 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1462 variables, 14/821 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:25] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:33:25] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2024-06-01 09:33:25] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:33:27] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2024-06-01 09:33:27] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1462 variables, 5/826 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:28] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-06-01 09:33:29] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-06-01 09:33:29] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1462 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:31] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 2 ms to minimize.
[2024-06-01 09:33:31] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1462 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 09:33:33] [INFO ] Deduced a trap composed of 80 places in 1063 ms of which 9 ms to minimize.
[2024-06-01 09:33:34] [INFO ] Deduced a trap composed of 79 places in 997 ms of which 8 ms to minimize.
[2024-06-01 09:33:35] [INFO ] Deduced a trap composed of 80 places in 978 ms of which 8 ms to minimize.
[2024-06-01 09:33:36] [INFO ] Deduced a trap composed of 77 places in 915 ms of which 8 ms to minimize.
[2024-06-01 09:33:37] [INFO ] Deduced a trap composed of 79 places in 942 ms of which 9 ms to minimize.
[2024-06-01 09:33:38] [INFO ] Deduced a trap composed of 74 places in 865 ms of which 8 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1462 variables, 6/837 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1462 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 210/1672 variables, 138/975 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1672 variables, 184/1159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1672 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (OVERLAPS) 0/1672 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 1159 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 612/612 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 45/45 constraints]
After SMT, in 51900ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 7 properties in 22806 ms.
Support contains 14 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3930/3930 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 612 transition count 3922
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 604 transition count 3922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 603 transition count 3912
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 603 transition count 3912
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 28 place count 598 transition count 3907
Applied a total of 28 rules in 319 ms. Remains 598 /612 variables (removed 14) and now considering 3907/3930 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 598/612 places, 3907/3930 transitions.
RANDOM walk for 40000 steps (8 resets) in 533 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 148456 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :8 out of 10
Probabilistic random walk after 148456 steps, saw 104852 distinct states, run finished after 3009 ms. (steps per millisecond=49 ) properties seen :8
[2024-06-01 09:34:14] [INFO ] Flow matrix only has 1037 transitions (discarded 2870 similar events)
// Phase 1: matrix 1037 rows 598 cols
[2024-06-01 09:34:14] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 09:34:14] [INFO ] State equation strengthened by 445 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:34:14] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:34:15] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 09:34:15] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 216/335 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 154/489 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 208/697 variables, 96/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/697 variables, 40/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/697 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 357/1054 variables, 16/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1054 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/1070 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1070 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 565/1635 variables, 373/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1635 variables, 364/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1635 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1635 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1635/1635 variables, and 1077 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 598/598 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:34:16] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 216/335 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 154/489 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 31/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 208/697 variables, 96/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/697 variables, 40/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/697 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 357/1054 variables, 16/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1054 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/1070 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1070 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:34:17] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 4 ms to minimize.
[2024-06-01 09:34:17] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1070 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1070 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 565/1635 variables, 373/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1635 variables, 364/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1635 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1635 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1635/1635 variables, and 1082 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2571 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 598/598 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 4136ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 142 ms.
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 3907/3907 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 598 transition count 3901
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 592 transition count 3901
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 591 transition count 3891
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 591 transition count 3891
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 0 with 2 rules applied. Total rules applied 16 place count 590 transition count 3890
Applied a total of 16 rules in 391 ms. Remains 590 /598 variables (removed 8) and now considering 3890/3907 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 590/598 places, 3890/3907 transitions.
RANDOM walk for 40000 steps (8 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271744 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271744 steps, saw 184022 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 09:34:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 09:34:22] [INFO ] Computed 31 invariants in 13 ms
[2024-06-01 09:34:22] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:34:22] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 388/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:34:24] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 388/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:34:25] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 5 ms to minimize.
[2024-06-01 09:34:25] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 4 ms to minimize.
[2024-06-01 09:34:25] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 4 ms to minimize.
[2024-06-01 09:34:25] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 4/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1064 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2710 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3721ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 282 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 254 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 09:34:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:34:26] [INFO ] Invariant cache hit.
[2024-06-01 09:34:28] [INFO ] Implicit Places using invariants in 1681 ms returned []
[2024-06-01 09:34:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:34:28] [INFO ] Invariant cache hit.
[2024-06-01 09:34:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 09:34:34] [INFO ] Implicit Places using invariants and state equation in 6100 ms returned []
Implicit Place search using SMT with State Equation took 7786 ms to find 0 implicit places.
[2024-06-01 09:34:35] [INFO ] Redundant transitions in 463 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 09:34:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 09:34:35] [INFO ] Invariant cache hit.
[2024-06-01 09:34:35] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34022ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42618 ms. Remains : 590/590 places, 3890/3890 transitions.
[2024-06-01 09:35:09] [INFO ] Flatten gal took : 282 ms
[2024-06-01 09:35:09] [INFO ] Flatten gal took : 284 ms
[2024-06-01 09:35:10] [INFO ] Input system was already deterministic with 4360 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 303 Pre rules applied. Total rules applied 20 place count 996 transition count 4047
Deduced a syphon composed of 303 places in 4 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 2 with 606 rules applied. Total rules applied 626 place count 693 transition count 4047
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 632 place count 687 transition count 3987
Iterating global reduction 2 with 6 rules applied. Total rules applied 638 place count 687 transition count 3987
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 4 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 808 place count 602 transition count 3902
Applied a total of 808 rules in 447 ms. Remains 602 /1006 variables (removed 404) and now considering 3902/4360 (removed 458) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 455 ms. Remains : 602/1006 places, 3902/4360 transitions.
[2024-06-01 09:35:10] [INFO ] Flatten gal took : 105 ms
[2024-06-01 09:35:11] [INFO ] Flatten gal took : 120 ms
[2024-06-01 09:35:11] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 64 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1001/1006 places, 4310/4360 transitions.
[2024-06-01 09:35:11] [INFO ] Flatten gal took : 113 ms
[2024-06-01 09:35:11] [INFO ] Flatten gal took : 129 ms
[2024-06-01 09:35:11] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 996 transition count 4040
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 686 transition count 4040
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 646 place count 680 transition count 3980
Iterating global reduction 2 with 6 rules applied. Total rules applied 652 place count 680 transition count 3980
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 828 place count 592 transition count 3892
Applied a total of 828 rules in 318 ms. Remains 592 /1006 variables (removed 414) and now considering 3892/4360 (removed 468) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 321 ms. Remains : 592/1006 places, 3892/4360 transitions.
[2024-06-01 09:35:12] [INFO ] Flatten gal took : 99 ms
[2024-06-01 09:35:12] [INFO ] Flatten gal took : 112 ms
[2024-06-01 09:35:12] [INFO ] Input system was already deterministic with 3892 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 71 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1000/1006 places, 4300/4360 transitions.
[2024-06-01 09:35:13] [INFO ] Flatten gal took : 115 ms
[2024-06-01 09:35:13] [INFO ] Flatten gal took : 130 ms
[2024-06-01 09:35:13] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 72 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1001/1006 places, 4310/4360 transitions.
[2024-06-01 09:35:13] [INFO ] Flatten gal took : 117 ms
[2024-06-01 09:35:13] [INFO ] Flatten gal took : 131 ms
[2024-06-01 09:35:14] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1006 transition count 4351
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 997 transition count 4351
Performed 301 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 301 Pre rules applied. Total rules applied 18 place count 997 transition count 4050
Deduced a syphon composed of 301 places in 4 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 2 with 602 rules applied. Total rules applied 620 place count 696 transition count 4050
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 626 place count 690 transition count 3990
Iterating global reduction 2 with 6 rules applied. Total rules applied 632 place count 690 transition count 3990
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 808 place count 602 transition count 3902
Applied a total of 808 rules in 469 ms. Remains 602 /1006 variables (removed 404) and now considering 3902/4360 (removed 458) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 475 ms. Remains : 602/1006 places, 3902/4360 transitions.
[2024-06-01 09:35:14] [INFO ] Flatten gal took : 158 ms
[2024-06-01 09:35:14] [INFO ] Flatten gal took : 112 ms
[2024-06-01 09:35:14] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1000 transition count 4300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1000 transition count 4300
Applied a total of 12 rules in 58 ms. Remains 1000 /1006 variables (removed 6) and now considering 4300/4360 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1000/1006 places, 4300/4360 transitions.
[2024-06-01 09:35:15] [INFO ] Flatten gal took : 99 ms
[2024-06-01 09:35:15] [INFO ] Flatten gal took : 116 ms
[2024-06-01 09:35:15] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 58 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 1001/1006 places, 4310/4360 transitions.
[2024-06-01 09:35:15] [INFO ] Flatten gal took : 104 ms
[2024-06-01 09:35:15] [INFO ] Flatten gal took : 120 ms
[2024-06-01 09:35:15] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1006 transition count 4351
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 997 transition count 4351
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 299 Pre rules applied. Total rules applied 18 place count 997 transition count 4052
Deduced a syphon composed of 299 places in 4 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 616 place count 698 transition count 4052
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 621 place count 693 transition count 4002
Iterating global reduction 2 with 5 rules applied. Total rules applied 626 place count 693 transition count 4002
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 4 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 800 place count 606 transition count 3915
Applied a total of 800 rules in 346 ms. Remains 606 /1006 variables (removed 400) and now considering 3915/4360 (removed 445) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 348 ms. Remains : 606/1006 places, 3915/4360 transitions.
[2024-06-01 09:35:16] [INFO ] Flatten gal took : 102 ms
[2024-06-01 09:35:16] [INFO ] Flatten gal took : 121 ms
[2024-06-01 09:35:16] [INFO ] Input system was already deterministic with 3915 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1006 transition count 4350
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 996 transition count 4350
Performed 305 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 305 Pre rules applied. Total rules applied 20 place count 996 transition count 4045
Deduced a syphon composed of 305 places in 4 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 2 with 610 rules applied. Total rules applied 630 place count 691 transition count 4045
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 635 place count 686 transition count 3995
Iterating global reduction 2 with 5 rules applied. Total rules applied 640 place count 686 transition count 3995
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 4 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 810 place count 601 transition count 3910
Applied a total of 810 rules in 295 ms. Remains 601 /1006 variables (removed 405) and now considering 3910/4360 (removed 450) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 296 ms. Remains : 601/1006 places, 3910/4360 transitions.
[2024-06-01 09:35:17] [INFO ] Flatten gal took : 88 ms
[2024-06-01 09:35:17] [INFO ] Flatten gal took : 105 ms
[2024-06-01 09:35:17] [INFO ] Input system was already deterministic with 3910 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 4360/4360 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1001 transition count 4310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1001 transition count 4310
Applied a total of 10 rules in 87 ms. Remains 1001 /1006 variables (removed 5) and now considering 4310/4360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1001/1006 places, 4310/4360 transitions.
[2024-06-01 09:35:17] [INFO ] Flatten gal took : 96 ms
[2024-06-01 09:35:17] [INFO ] Flatten gal took : 114 ms
[2024-06-01 09:35:17] [INFO ] Input system was already deterministic with 4310 transitions.
[2024-06-01 09:35:18] [INFO ] Flatten gal took : 113 ms
[2024-06-01 09:35:18] [INFO ] Flatten gal took : 119 ms
[2024-06-01 09:35:18] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 09:35:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1006 places, 4360 transitions and 22040 arcs took 34 ms.
Total runtime 205890 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-10-CTLCardinality-2023-14

BK_STOP 1717234518684

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/737/ctl_0_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/737/ctl_1_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/737/ctl_2_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/737/ctl_3_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/737/ctl_4_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/737/ctl_5_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/737/ctl_6_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/737/ctl_7_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/737/ctl_8_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/737/ctl_9_
ctl formula name EisenbergMcGuire-PT-10-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/737/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;