fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445200122
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16202.960 3600000.00 13073001.00 2241.30 ?????????T??F??? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445200122.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S04J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716849032800

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:30:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 22:30:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:30:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:30:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:30:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1021 ms
[2024-05-27 22:30:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2024-05-27 22:30:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:30:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 51 to 50
RANDOM walk for 40000 steps (11 resets) in 1635 ms. (24 steps per ms) remains 9/50 properties
BEST_FIRST walk for 40001 steps (8 resets) in 528 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (22 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 305 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (13 resets) in 299 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 260 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
[2024-05-27 22:30:36] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:30:36] [INFO ] Computed 26 invariants in 8 ms
[2024-05-27 22:30:36] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp50 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-27 22:30:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 27 constraints, problems are : Problem set: 9 solved, 0 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 787ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:30:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 22:30:37] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S04J04T06-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:30:37] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:30:37] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 75 ms.
[2024-05-27 22:30:37] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-27 22:30:37] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-27 22:30:37] [INFO ] Reduced 264 identical enabling conditions.
[2024-05-27 22:30:37] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 445 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 35 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:30:37] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:30:37] [INFO ] Computed 46 invariants in 87 ms
[2024-05-27 22:30:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:30:53] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 3 ms to minimize.
[2024-05-27 22:30:53] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:30:53] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-27 22:30:54] [INFO ] Deduced a trap composed of 75 places in 537 ms of which 1 ms to minimize.
[2024-05-27 22:30:54] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:30:55] [INFO ] Deduced a trap composed of 313 places in 414 ms of which 8 ms to minimize.
[2024-05-27 22:30:55] [INFO ] Deduced a trap composed of 167 places in 309 ms of which 4 ms to minimize.
[2024-05-27 22:30:56] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-05-27 22:30:57] [INFO ] Deduced a trap composed of 319 places in 303 ms of which 4 ms to minimize.
[2024-05-27 22:30:57] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 3 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 317 places in 298 ms of which 3 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 323 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 311 places in 306 ms of which 3 ms to minimize.
[2024-05-27 22:30:58] [INFO ] Deduced a trap composed of 322 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:30:59] [INFO ] Deduced a trap composed of 313 places in 301 ms of which 3 ms to minimize.
[2024-05-27 22:30:59] [INFO ] Deduced a trap composed of 307 places in 298 ms of which 3 ms to minimize.
[2024-05-27 22:30:59] [INFO ] Deduced a trap composed of 322 places in 314 ms of which 4 ms to minimize.
[2024-05-27 22:31:00] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 3 ms to minimize.
[2024-05-27 22:31:00] [INFO ] Deduced a trap composed of 315 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:31:01] [INFO ] Deduced a trap composed of 292 places in 335 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:31:01] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 2 ms to minimize.
[2024-05-27 22:31:02] [INFO ] Deduced a trap composed of 265 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:31:03] [INFO ] Deduced a trap composed of 245 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 25239ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 25264ms
[2024-05-27 22:31:03] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:31:03] [INFO ] Invariant cache hit.
[2024-05-27 22:31:03] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-27 22:31:03] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:31:03] [INFO ] Invariant cache hit.
[2024-05-27 22:31:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:31:06] [INFO ] Implicit Places using invariants and state equation in 3472 ms returned []
Implicit Place search using SMT with State Equation took 3625 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:31:06] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:31:06] [INFO ] Invariant cache hit.
[2024-05-27 22:31:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:31:21] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:31:21] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:31:21] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:31:21] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 2 ms to minimize.
[2024-05-27 22:31:21] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:31:22] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:31:22] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:31:24] [INFO ] Deduced a trap composed of 297 places in 395 ms of which 5 ms to minimize.
[2024-05-27 22:31:24] [INFO ] Deduced a trap composed of 313 places in 337 ms of which 4 ms to minimize.
[2024-05-27 22:31:25] [INFO ] Deduced a trap composed of 272 places in 307 ms of which 4 ms to minimize.
[2024-05-27 22:31:25] [INFO ] Deduced a trap composed of 333 places in 340 ms of which 5 ms to minimize.
[2024-05-27 22:31:25] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 4 ms to minimize.
[2024-05-27 22:31:26] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 303 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 305 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 282 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-05-27 22:31:40] [INFO ] Deduced a trap composed of 321 places in 325 ms of which 4 ms to minimize.
[2024-05-27 22:31:40] [INFO ] Deduced a trap composed of 321 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:31:41] [INFO ] Deduced a trap composed of 317 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 62 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:31:51] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-27 22:32:00] [INFO ] Deduced a trap composed of 285 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:32:01] [INFO ] Deduced a trap composed of 277 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:32:01] [INFO ] Deduced a trap composed of 272 places in 316 ms of which 5 ms to minimize.
[2024-05-27 22:32:01] [INFO ] Deduced a trap composed of 319 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:32:02] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:32:02] [INFO ] Deduced a trap composed of 332 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:32:02] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 2 ms to minimize.
[2024-05-27 22:32:03] [INFO ] Deduced a trap composed of 292 places in 282 ms of which 5 ms to minimize.
[2024-05-27 22:32:03] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 4 ms to minimize.
[2024-05-27 22:32:04] [INFO ] Deduced a trap composed of 279 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:32:04] [INFO ] Deduced a trap composed of 274 places in 313 ms of which 4 ms to minimize.
[2024-05-27 22:32:04] [INFO ] Deduced a trap composed of 259 places in 295 ms of which 6 ms to minimize.
[2024-05-27 22:32:07] [INFO ] Deduced a trap composed of 119 places in 238 ms of which 4 ms to minimize.
[2024-05-27 22:32:07] [INFO ] Deduced a trap composed of 244 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 77 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 35/35 constraints]
After SMT, in 65297ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 65311ms
Starting structural reductions in LTL mode, iteration 1 : 550/554 places, 1372/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94261 ms. Remains : 550/554 places, 1372/1372 transitions.
Support contains 445 out of 550 places after structural reductions.
[2024-05-27 22:32:12] [INFO ] Flatten gal took : 214 ms
[2024-05-27 22:32:12] [INFO ] Flatten gal took : 136 ms
[2024-05-27 22:32:12] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 439 out of 550 places (down from 445) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 48 to 45
RANDOM walk for 40000 steps (8 resets) in 1446 ms. (27 steps per ms) remains 6/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 786 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 617 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 703 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 545 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1296 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 6/6 properties
[2024-05-27 22:32:15] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:32:15] [INFO ] Invariant cache hit.
[2024-05-27 22:32:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 2 (OVERLAPS) 91/254 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Real declared 528/1898 variables, and 33 constraints, problems are : Problem set: 6 solved, 0 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2024-05-27 22:32:16] [INFO ] Flatten gal took : 133 ms
[2024-05-27 22:32:16] [INFO ] Flatten gal took : 65 ms
[2024-05-27 22:32:16] [INFO ] Input system was already deterministic with 1372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Applied a total of 12 rules in 55 ms. Remains 544 /550 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-27 22:32:16] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-05-27 22:32:16] [INFO ] Computed 46 invariants in 74 ms
[2024-05-27 22:32:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:32:32] [INFO ] Deduced a trap composed of 74 places in 1067 ms of which 1 ms to minimize.
[2024-05-27 22:32:32] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:32:33] [INFO ] Deduced a trap composed of 74 places in 737 ms of which 1 ms to minimize.
[2024-05-27 22:32:33] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:32:33] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:32:33] [INFO ] Deduced a trap composed of 299 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:32:34] [INFO ] Deduced a trap composed of 121 places in 257 ms of which 2 ms to minimize.
[2024-05-27 22:32:34] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:32:34] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 2 ms to minimize.
[2024-05-27 22:32:35] [INFO ] Deduced a trap composed of 313 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:32:36] [INFO ] Deduced a trap composed of 289 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:32:36] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 143 places in 214 ms of which 3 ms to minimize.
[2024-05-27 22:32:40] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:32:40] [INFO ] Deduced a trap composed of 312 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:32:41] [INFO ] Deduced a trap composed of 305 places in 268 ms of which 3 ms to minimize.
SMT process timed out in 24347ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 24372ms
Finished structural reductions in LTL mode , in 1 iterations and 24431 ms. Remains : 544/550 places, 1366/1372 transitions.
[2024-05-27 22:32:41] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:32:41] [INFO ] Flatten gal took : 82 ms
[2024-05-27 22:32:41] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 68 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:32:41] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:32:41] [INFO ] Computed 46 invariants in 55 ms
[2024-05-27 22:32:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:32:56] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:32:56] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 133 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:32:58] [INFO ] Deduced a trap composed of 309 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:32:59] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:33:05] [INFO ] Deduced a trap composed of 296 places in 458 ms of which 19 ms to minimize.
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 Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:33:13] [INFO ] Deduced a trap composed of 310 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:33:13] [INFO ] Deduced a trap composed of 274 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:33:14] [INFO ] Deduced a trap composed of 267 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:33:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 282 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 279 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 297 places in 271 ms of which 3 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 274 places in 242 ms of which 3 ms to minimize.
[2024-05-27 22:33:25] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 44710ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44750ms
Finished structural reductions in LTL mode , in 1 iterations and 44821 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-05-27 22:33:26] [INFO ] Flatten gal took : 48 ms
[2024-05-27 22:33:26] [INFO ] Flatten gal took : 51 ms
[2024-05-27 22:33:26] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:33:26] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:33:26] [INFO ] Computed 46 invariants in 57 ms
[2024-05-27 22:33:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:33:40] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:33:40] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-27 22:33:40] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:33:40] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:33:40] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:33:41] [INFO ] Deduced a trap composed of 313 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:33:41] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:33:43] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2024-05-27 22:33:44] [INFO ] Deduced a trap composed of 319 places in 310 ms of which 3 ms to minimize.
[2024-05-27 22:33:44] [INFO ] Deduced a trap composed of 320 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:33:44] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:33:45] [INFO ] Deduced a trap composed of 323 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:33:45] [INFO ] Deduced a trap composed of 311 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:33:45] [INFO ] Deduced a trap composed of 322 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:33:45] [INFO ] Deduced a trap composed of 313 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:33:46] [INFO ] Deduced a trap composed of 307 places in 276 ms of which 3 ms to minimize.
[2024-05-27 22:33:46] [INFO ] Deduced a trap composed of 322 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:33:46] [INFO ] Deduced a trap composed of 311 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:33:47] [INFO ] Deduced a trap composed of 315 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:33:47] [INFO ] Deduced a trap composed of 292 places in 287 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:33:48] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:33:49] [INFO ] Deduced a trap composed of 265 places in 266 ms of which 4 ms to minimize.
[2024-05-27 22:33:49] [INFO ] Deduced a trap composed of 245 places in 289 ms of which 3 ms to minimize.
[2024-05-27 22:33:50] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 3 ms to minimize.
[2024-05-27 22:33:50] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 3 ms to minimize.
[2024-05-27 22:33:51] [INFO ] Deduced a trap composed of 280 places in 269 ms of which 3 ms to minimize.
SMT process timed out in 24688ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 24701ms
Finished structural reductions in LTL mode , in 1 iterations and 24715 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-05-27 22:33:51] [INFO ] Flatten gal took : 62 ms
[2024-05-27 22:33:51] [INFO ] Flatten gal took : 119 ms
[2024-05-27 22:33:51] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 92 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:33:51] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:33:51] [INFO ] Computed 46 invariants in 35 ms
[2024-05-27 22:33:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:34:07] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:34:07] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:34:07] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2024-05-27 22:34:07] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:34:07] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:34:08] [INFO ] Deduced a trap composed of 133 places in 246 ms of which 4 ms to minimize.
[2024-05-27 22:34:08] [INFO ] Deduced a trap composed of 309 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:34:10] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:34:14] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:34:24] [INFO ] Deduced a trap composed of 310 places in 227 ms of which 2 ms to minimize.
[2024-05-27 22:34:24] [INFO ] Deduced a trap composed of 274 places in 218 ms of which 3 ms to minimize.
[2024-05-27 22:34:24] [INFO ] Deduced a trap composed of 267 places in 228 ms of which 2 ms to minimize.
[2024-05-27 22:34:26] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:34:33] [INFO ] Deduced a trap composed of 282 places in 249 ms of which 2 ms to minimize.
[2024-05-27 22:34:34] [INFO ] Deduced a trap composed of 279 places in 265 ms of which 3 ms to minimize.
[2024-05-27 22:34:34] [INFO ] Deduced a trap composed of 297 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:34:34] [INFO ] Deduced a trap composed of 274 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:34:35] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 45312ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45339ms
Finished structural reductions in LTL mode , in 1 iterations and 45434 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-05-27 22:34:37] [INFO ] Flatten gal took : 47 ms
[2024-05-27 22:34:37] [INFO ] Flatten gal took : 46 ms
[2024-05-27 22:34:37] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:34:37] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:34:37] [INFO ] Computed 46 invariants in 33 ms
[2024-05-27 22:34:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:34:53] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:34:53] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:34:53] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-27 22:34:53] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:34:53] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 313 places in 256 ms of which 13 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 319 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:34:56] [INFO ] Deduced a trap composed of 320 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:34:56] [INFO ] Deduced a trap composed of 317 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:34:56] [INFO ] Deduced a trap composed of 323 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:34:57] [INFO ] Deduced a trap composed of 311 places in 286 ms of which 3 ms to minimize.
[2024-05-27 22:34:57] [INFO ] Deduced a trap composed of 322 places in 279 ms of which 4 ms to minimize.
[2024-05-27 22:34:57] [INFO ] Deduced a trap composed of 313 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:34:58] [INFO ] Deduced a trap composed of 307 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:34:58] [INFO ] Deduced a trap composed of 322 places in 273 ms of which 2 ms to minimize.
[2024-05-27 22:34:58] [INFO ] Deduced a trap composed of 311 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:34:58] [INFO ] Deduced a trap composed of 315 places in 264 ms of which 3 ms to minimize.
[2024-05-27 22:34:59] [INFO ] Deduced a trap composed of 292 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:35:00] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:35:00] [INFO ] Deduced a trap composed of 265 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:35:01] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 3 ms to minimize.
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 3 ms to minimize.
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 57 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 280 places in 292 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 68 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:35:05] [INFO ] Deduced a trap composed of 283 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:35:10] [INFO ] Deduced a trap composed of 312 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:35:12] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2024-05-27 22:35:19] [INFO ] Deduced a trap composed of 279 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 277 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 281 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:35:21] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:35:21] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:35:21] [INFO ] Deduced a trap composed of 297 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 298 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 282 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 259 places in 264 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 80 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 38/38 constraints]
After SMT, in 45864ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45877ms
Finished structural reductions in LTL mode , in 1 iterations and 45890 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-05-27 22:35:23] [INFO ] Flatten gal took : 39 ms
[2024-05-27 22:35:23] [INFO ] Flatten gal took : 42 ms
[2024-05-27 22:35:23] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 550 transition count 1354
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 42 place count 532 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 526 transition count 1348
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 526 transition count 1312
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 120 place count 490 transition count 1312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 484 transition count 1306
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 484 transition count 1306
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 240 place count 430 transition count 1252
Applied a total of 240 rules in 180 ms. Remains 430 /550 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-27 22:35:23] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 430 cols
[2024-05-27 22:35:23] [INFO ] Computed 46 invariants in 15 ms
[2024-05-27 22:35:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:35:35] [INFO ] Deduced a trap composed of 209 places in 210 ms of which 3 ms to minimize.
[2024-05-27 22:35:36] [INFO ] Deduced a trap composed of 203 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:35:36] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:35:36] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 3 ms to minimize.
[2024-05-27 22:35:36] [INFO ] Deduced a trap composed of 225 places in 226 ms of which 2 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 223 places in 226 ms of which 2 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 218 places in 228 ms of which 2 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 221 places in 225 ms of which 3 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 211 places in 231 ms of which 2 ms to minimize.
[2024-05-27 22:35:38] [INFO ] Deduced a trap composed of 252 places in 228 ms of which 3 ms to minimize.
[2024-05-27 22:35:38] [INFO ] Deduced a trap composed of 201 places in 284 ms of which 2 ms to minimize.
[2024-05-27 22:35:38] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.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 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1658 variables, and 60 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/430 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:35:52] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:36:04] [INFO ] Deduced a trap composed of 149 places in 204 ms of which 3 ms to minimize.
[2024-05-27 22:36:05] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1658 variables, and 64 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/430 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 22/22 constraints]
After SMT, in 44551ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44576ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44772 ms. Remains : 430/550 places, 1252/1372 transitions.
[2024-05-27 22:36:08] [INFO ] Flatten gal took : 40 ms
[2024-05-27 22:36:08] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:36:08] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 50 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:36:08] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:36:08] [INFO ] Computed 46 invariants in 43 ms
[2024-05-27 22:36:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:36:22] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2024-05-27 22:36:23] [INFO ] Deduced a trap composed of 133 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:36:24] [INFO ] Deduced a trap composed of 309 places in 261 ms of which 4 ms to minimize.
[2024-05-27 22:36:25] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:36:30] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 310 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 274 places in 248 ms of which 2 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 267 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:36:43] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-27 22:36:50] [INFO ] Deduced a trap composed of 282 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:36:51] [INFO ] Deduced a trap composed of 279 places in 259 ms of which 3 ms to minimize.
[2024-05-27 22:36:51] [INFO ] Deduced a trap composed of 297 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:36:51] [INFO ] Deduced a trap composed of 274 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:36:52] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 45186ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45241ms
Finished structural reductions in LTL mode , in 1 iterations and 45305 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-05-27 22:36:53] [INFO ] Flatten gal took : 57 ms
[2024-05-27 22:36:53] [INFO ] Flatten gal took : 46 ms
[2024-05-27 22:36:53] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:36:53] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:36:53] [INFO ] Computed 46 invariants in 19 ms
[2024-05-27 22:36:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:37:08] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:37:08] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:37:08] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 1 ms to minimize.
[2024-05-27 22:37:08] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:37:08] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 0 ms to minimize.
[2024-05-27 22:37:09] [INFO ] Deduced a trap composed of 313 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:37:09] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 3 ms to minimize.
[2024-05-27 22:37:10] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2024-05-27 22:37:11] [INFO ] Deduced a trap composed of 319 places in 293 ms of which 3 ms to minimize.
[2024-05-27 22:37:11] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:37:11] [INFO ] Deduced a trap composed of 317 places in 327 ms of which 4 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 323 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 311 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:37:12] [INFO ] Deduced a trap composed of 322 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:37:13] [INFO ] Deduced a trap composed of 313 places in 324 ms of which 4 ms to minimize.
[2024-05-27 22:37:13] [INFO ] Deduced a trap composed of 307 places in 265 ms of which 3 ms to minimize.
[2024-05-27 22:37:13] [INFO ] Deduced a trap composed of 322 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:37:13] [INFO ] Deduced a trap composed of 311 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:37:14] [INFO ] Deduced a trap composed of 315 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:37:14] [INFO ] Deduced a trap composed of 292 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:37:15] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:37:16] [INFO ] Deduced a trap composed of 265 places in 319 ms of which 4 ms to minimize.
[2024-05-27 22:37:16] [INFO ] Deduced a trap composed of 245 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:37:18] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:37:18] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 3 ms to minimize.
[2024-05-27 22:37:18] [INFO ] Deduced a trap composed of 280 places in 289 ms of which 3 ms to minimize.
SMT process timed out in 24968ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 24981ms
Finished structural reductions in LTL mode , in 1 iterations and 24991 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-05-27 22:37:18] [INFO ] Flatten gal took : 44 ms
[2024-05-27 22:37:18] [INFO ] Flatten gal took : 47 ms
[2024-05-27 22:37:19] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 17 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:37:19] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:37:19] [INFO ] Computed 46 invariants in 34 ms
[2024-05-27 22:37:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 2 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 133 places in 320 ms of which 5 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 309 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:37:36] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 2 ms to minimize.
[2024-05-27 22:37:40] [INFO ] Deduced a trap composed of 296 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:37:50] [INFO ] Deduced a trap composed of 310 places in 217 ms of which 3 ms to minimize.
[2024-05-27 22:37:50] [INFO ] Deduced a trap composed of 274 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:37:51] [INFO ] Deduced a trap composed of 267 places in 249 ms of which 2 ms to minimize.
[2024-05-27 22:37:52] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 282 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 279 places in 238 ms of which 13 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 297 places in 231 ms of which 3 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 274 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:38:01] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 44632ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44645ms
Finished structural reductions in LTL mode , in 1 iterations and 44665 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-05-27 22:38:03] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:38:03] [INFO ] Flatten gal took : 47 ms
[2024-05-27 22:38:03] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 48 rules applied. Total rules applied 84 place count 514 transition count 1324
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 502 transition count 1324
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 96 place count 502 transition count 1258
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 228 place count 436 transition count 1258
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 312 place count 394 transition count 1216
Applied a total of 312 rules in 117 ms. Remains 394 /550 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-27 22:38:03] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 394 cols
[2024-05-27 22:38:04] [INFO ] Computed 46 invariants in 15 ms
[2024-05-27 22:38:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
SMT process timed out in 24888ms, After SMT, problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 24900ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25020 ms. Remains : 394/550 places, 1216/1372 transitions.
[2024-05-27 22:38:28] [INFO ] Flatten gal took : 41 ms
[2024-05-27 22:38:28] [INFO ] Flatten gal took : 43 ms
[2024-05-27 22:38:29] [INFO ] Input system was already deterministic with 1216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 550 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 508 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 502 transition count 1324
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 96 place count 502 transition count 1288
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 168 place count 466 transition count 1288
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 288 place count 406 transition count 1228
Applied a total of 288 rules in 54 ms. Remains 406 /550 variables (removed 144) and now considering 1228/1372 (removed 144) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-27 22:38:29] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 406 cols
[2024-05-27 22:38:29] [INFO ] Computed 46 invariants in 37 ms
[2024-05-27 22:38:29] [INFO ] State equation strengthened by 120 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T06

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.49

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 554
TRANSITIONS: 2998
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 20754
UNFOLDING TIME: 0.657

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.142
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.571
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1459
MODEL NAME: /home/mcc/execution/model
554 places, 2998 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLFireability -timeout 360 -rebuildPNML

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="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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